自相似业务流下的星上交换全局优化缓冲分配算法

针对空间信息网络星上交换节点缓冲资源有限,提出一种适用于星上交换的缓冲优化分配算法。采用了Crossbar交换模型,在此基础上建立了虚通道自相似排队模型,通过计算每个虚通道缓冲溢出概率并采用遗传算法来实现缓冲资源全局优化分配。仿真结果表明,与均匀分配算法和贪婪分配算法相比,新算法具有更好的延时性能,在同等分组平均时延、业务流自相似程度为0.6和0.8的情况下,新算法比均匀分配算法可分别节省24.5%和26.4%的缓冲资源,并且分配效率比贪婪分配算法提高约21.9%。     

A new metric for dynamic routing algorithms

A dynamic routing algorithm that has as its goal the control of congestion in a packet switching network is presented. The algorithm is based in part on the ARPANET SPF algorithm. However, instead of employing a delay metric, the authors make use of a combination of link and buffer utilizations. A detailed simulation model of the ARPANET was constructed to compare the performance of the congestion-based algorithm to the traditional delay-based (SPF) routing algorithm. The results indicate a substantial improvement in the delay and throughput of the network with the congestion-based routing algorithm     

光总线交换网络输出排队两级缓冲结构与性能分析

为了解决核心路由器高速无阻塞光总线交换网络体系结构中的高速大容量分组缓冲这一关键技术难题,本文提出了基于SRAM技术和DRAM技术相结合的输出排队分组两级缓冲结构及相关LBF-MMA存储器管理算法,并利用实测的网络流量数据对该缓冲技术的性能进行了仿真分析.分析表明,两级缓冲结构较好地解决了光总线交换网络中分组缓冲高速度与大容量之间的矛盾,对高速路由器技术的发展也具有一定的指导意义.     

Improving mobile network performance with two queueing buffer allocations of priority-based queueing scheme

As current mobile core network systems are expected to evolve into all-IP networks, packet switching will be a prerequisite for all mobile applications. Next-generation mobile networks, as envisioned by ITU-T, are packet-based networks capable of providing consistent and ubiquitous service to end users, independent of the network, access technology, and device used. This study discusses the differentiated packet forwarding performance of four major types of mobile network traffic under the proposed mobile network priority-based queueing (MPQ) scheme with two queueing buffer allocations, namely dynamic queueing buffer (DQB) allocation and overflow queueing buffer (OQB) allocation. As different queueing buffer allocations are adopted to store arriving packets in DQB and OQB, the MPQ scheme shows different packet forwarding performance under these two methods. In this study, we use ns2 (Network Simulator version 2) as the simulation platform to simulate several scenarios. The simulation results show that the MPQ scheme is able to support differentiated packet forwarding behavior for mobile traffic with both DQB and OQB allocations in a mobile core network. Some issues were identified in the MPQ scheme with both DQB and OQB allocation, which will need to be addressed.     

未来光因特网中的光交换方式及其发展趋势

Internet的业务流量正以每六个月翻一番的速度快速增长,未来网络中,数据业务超过话音业务只是时间问题,因此,基于电路交换的电信网升级到支持基于分组交换的数据业务是不可避免的,但是对因特网来说,由于光逻辑与光存储等器件不成熟,发展全光分组交换,技术上异常困难。另一方面,近来新提出的光突发交换,技术上相对简单,性能特点优异,因而成为更理想的选择,本文介绍了全光分组交换和光突发交换的研究现状,比较了两者的优缺点,最后指出改进光突发交换性能的两种方式。     

Software Protocol for Handling ISDN in the Packet-Switched Network

The Integrated Services Digital Network (ISDN) provides basic architecture for existing, as well as future residential plus business communications. ISDN overlayed with CCS#7 of a digital PSTN (Public Switched Telephone Network) can be the ultimate, ubiquitous network for circuit switch (voice, data), packet switch (voice, data), and private line (voice, data) applications. Assuming that the present ISDN has to interwork in the present physically separate overlayed networks (voice and data), significant problems are expected to emerge for designing hardware and linking softwares for handling packet traffic. In this paper, the software-related problems, when ISDN packet distribution nodes have to handle an ISDN interface, will be outlined with an ISDN software protocol solution. An approximation of the delay involved in the telephone switching system which is part of ISDN processing as well as the delay for the interface gateways, the HOST computer nodes, and the LAN and WAN computer nodes will be identified and formulated to reflect the total performance measure defined. Major emphasis is given to flow and congestion control performance measures in the ISDN Gateways, which are analyzed and simulated with the assistance of the basic delay table transfer software model developed for the IMPS and gateways in the ARPANET, MILNET, and MINET. The performance evaluation of this basic ISDN interfacing software, which only involved one ISDN level, i.e., the HOST or gateway and its related subnetworks, is simulated on sections of these networks to illustrate its congestion control effectiveness. There are six mathematical software techniques to account for end-to-end delay, which form the basis for the solution to these ISDN software-hardware problems in the Interface Gateways connecting the electronic switch to the computer network components.     

The New Routing Algorithm for the ARPANET

The new ARPANET routing algorithm is an improvement over the old procedure in that it uses fewer network resources, operates on more realistic estimates of network conditions, reacts faster to important network changes, and does not suffer from long-term loops or oscillations. In the new procedure, each node in the network maintains a database describing the complete network topology and the delays on all lines, and uses the database describing the network to generate a tree representing the minimum delay paths from a given root node to every other network node. Because the traffic in the network can be quite variable, each node periodically measures the delays along its outgoing lines and forwards this information to all other nodes. The delay information propagates quickly through the network so that all nodes can update their databases and continue to route traffic in a consistent and efficient manner. An extensive series of tests were conducted on the ARPANET, showing that line overhead and CPU overhead are both less than two percent, most nodes learn of an update within 100 ms, and the algorithm detects congestion and routes packets around congested areas.     

Performance Analysis of a Quasi-M/D/1 Cut-Through Switching Network with Noisy Channels

Cut-through switching is advantageous in that it can reduce the transmission delay compared with the conventional message or packet switching. In this paper, when the channel is noisy, we investigate various properties ofM/D/1quasi-cut-through switching including actual traffic intensity and overall network delay. In the analysis of delay resulting from retransmission of erroneous packets, we have included the average transmission time of negative acknowledgment signal and queueing time for the retransmitted packet so that the overall network delay can be obtained accurately. In addition, we have obtained distributions of the number of nodes to be traversed and the number of nodes through which packets pass by cut. According to the analysis results, the performance of cut-through switching is superior to that of conventional packet switching in most practical ranges of parameter values.     

Physical and logical validation of a network based on all-opticalpacket switching systems

The large growth of telecommunication traffic demand generated by multiple new applications and expected to last at least for the next decade will force telecom operators to consider offering more flexible transport services. All-optical packet switching is a powerful technique to provide this flexibility and to support in a cost-efficient way a wide range of bandwidth consuming applications. After a very brief introduction about the packet-switched network architecture studied in the framework of the ACTS KEOPS project, we describe the structure of the packet-switching node we have defined. We then move into physical and logical analysis of the network including more than 40 network sections based on 160 Gb/s throughput optical packet switching nodes could operate error free. In addition, logical simulations have proved that such networks could provide a quality of service (packet loss rate and packet transfer delay per node) compatible with a large variety of service classes. Both results validate the feasibility of the network concept and pace the way toward a flexible network based on all-optical switching techniques     

Cross-layer cut-through switching mechanism for IEEE 802.16d/e wireless networks

This paper proposes a fast cross-layer cut-through switching mechanism (CCSM) for supporting media access control (MAC) layer packet switching in IEEE 802.16-based broadband wireless access (BWA) networks. The local traffic, which means subscriber stations (SSs) communicating with each other within the cell, can be switched via the MAC layer without involving the network layer. The average access delay of request from SSs is studied and analyzed in this paper. Finally, the simulation and numerical results show that the performance of CCSM is superior to that of the legacy IEEE 802.16d/e protocol.     

Bypassing omega network for high speed packet switching

A highly regular switching network consisting of several switching stages for output buffering is proposed. Each switching element performs 3×3 switching and has a tail-spared buffer for each input port. According to the performance evaluation of the proposed switching network based on computer simulation, a packet loss ratio of 10^-8 was obtained for a 1024×1024 switching network consisting of 15 stages with the Bernoulli traffic source when the size of tail-spared buffer is 8 and the input traffic load is 0.9     

The knockout switch under nonuniform traffic

The knockout switch is a nonblocking, high-performance switch suitable for broadband packet switching. It allows packet losses, but the probability of a packet loss can be kept extremely small in a cost-effective way. The performance of the knockout switch was analyzed under uniform traffic. In this paper, we present a new, more general analytic model of the knockout switch, which enables us to evaluate the knockout switch under nonuniform traffic. The new model also incorporates the effects of a concentrator and a shared buffer on the packet loss probability. Numerical results for nonuniform traffic patterns of interest are presented     

Addressing self-similarity in optical switching networks by means of ant colony optimization

In this work, we propose the use of an Ant Colony Optimization (ACO) algorithm to mitigate packet loss in an optical packet switching network that carries self-similar traffic, which is known to have a great impact in the buffer performance in terms of loss probability as exemplified in this work. By adaptively routing the packets and balancing the network load, we demonstrate by some simulations the effectiveness of this approach when compared with a shortest-path routing scheme, achieving a performance that is comparable to the Poisson traffic scenario in some cases. The proposed algorithm can be used as a viable alternative to traffic shaping techniques.     

Dimensioning an ATM switch based on a three-stage Clos interconnection network

ATM (asynchronous transfer mode) is a new technique for transmitting voice, data and video. The performance of atm networks will depend on switch structure. Performance analysis of an atm switch based on a three-stage Clos network is presented. In this paper two types of switches are studied: a switch with input queues in the switching elements and a switch with output queues. This study is at the cell level and intends to dimension the switch. First, the traffic is supposed to be uniform, cells arrive on each input according to a geometric arrival process, they are uniformly directed over all the network outputs. An analytic model is proposed for both input and output queues in the switching elements. A study of the saturation throughput is proposed for input buffer switching elements. This work proves the influence of buffer dimensioning on the different stages of the switch. Dissymmetric switching elements are shown to be better than symmetric ones. A model is then designed for nonuniform traffic patterns and output buffers. Two types of non-uniform traffic are presented: single source to single destination (sssd) and multi-hot spots traffic (mhs). Discrete event simulations are used to validate the different models.     

Fast Switching and Fair Control of Congested Flow in Broadband Networks

A new switching architecture is proposed based on the tradeoffs of modern VLSI technology-inexpensive memory and 2-dimensional layout structures. Today, it is economically feasible to preallocate buffer space individually to each virtual circuit in every node, so that "congestion" ceases to have negative effects. On the contrary, when some low-priority circuits offer more traffic than the network can carry, full utilization of the link bandwidth is achieved. In this context, the allocation of bandwidth can be done automatically and in a "fair" way, if packets are multiplexed by circularly scanning all virtual circuits and transmitting one packet from each "ready" circuit. This multiplexing algorithm equally distributes all the available link BW to all the VC's that can use it (other than equal distribution is also possible), while it also guarantees an upper bound for the total packet delay through noncongested VC's (VC's that use less than their share of BW). We present methods for hardware implementation of such fast circular scans, and propose a structure for the switching nodes of such networks, consisting of a cross-bar arrangement like a systolic array that performs merge sorting. It is ideally suited for physical layout on printed-circuit boards or with wafer-scale integration.     

Optical burst switching for service differentiation in thenext-generation optical Internet

In an effort to eliminate the electronic bottleneck, new optical switches/routers (hardware) are being built for the next-generation optical Internet where IP runs over an all-optical WDM layer. However, important issues yet to be addressed in terms of protocols (software) are how to develop a new paradigm that does not require any buffer at the WDM layer, as in circuit switching, and elimination of any layers between which exist mainly due to historical reasons. At the same time, such a paradigm should also efficiently support bursty traffic with high resource utilization as in packet switching. This article surveys design issues related to a new switching paradigm called optical burst switching, which achieves a balance between circuit and packet switching while avoiding their shortcomings. We describe how OBS can be applied to the next-generation optical Internet, and in particular how offset times and delayed reservation can help avoid the use of buffer, and support quality of service at the WDM layer     

Optical cross-connect system in broad-band networks: system conceptand demonstrators description

A network robust to future evolution in network topologies or transmission formats and bit rates, which would be achieved by introducing an all-optical transparent layer in the transport network hierarchy is considered. The transparency would permit use of physically common fiber lines and nodes for different transmission hierarchies and/or formats. A transparent network could be achieved by combining photonic switching with electronic switching technology in the network nodes. A combination of wavelength routing and space-division switching in the optical layer would increase the capacity, as well as the flexibility in a network, allowing routing with higher granularity within the optical layer. Two optical cross-connect demonstrators have been set up. One demonstrates protection switching and restoration of traffic in a future transport network, and the other demonstrates routing of subscriber signals to different service switches in a local exchange. Space switches, tunable lasers and filters are the key technologies used to obtain enhanced flexibility     

Soft‐State Bandwidth Reservation Mechanism for Slotted Optical Burst Switching Networks

This paper proposes a novel transport network architecture for the next generation network (NGN) based on the optical burst switching technology. The proposed architecture aims to provide efficient delivery of various types of network traffic by satisfying their quality‐of‐service constraints. To this end, we have developed a soft‐state bandwidth reservation mechanism, which enables NGN transport nodes to dynamically reserve bandwidth needed for active data burst flows. The performance of the proposed mechanism is evaluated by means of numerical analysis and NS2 simulation. Our results show that the packet delay is kept within the constraint for each traffic flow and the burst loss rate is remarkably improved.     

Delay and Throughput Evaluation of Switching Methods in Computer Communication Networks

Message, packet and line switching in computer communication networks are analyzed by a queueing model. Message transmission delay time and network throughput between a source-destination node pair are obtained as a function of various parameters including message length, traffic arriving at the network, and the number of switching nodes existing between the nodes. A criterion to determine the most suitable switching method under the given conditions is offered. Also, the maximum length of a packet in packet switching is discussed.     

LOBS技术研究

光突发交换技术(OBS)是一种新出现的光交换技术,它综合了光波长路由和光分组交换的优点。本文的LOBS又将MPLS 和OBS这两大技术结合在一起,利用MPLS强大的控制能力为OBS网络在QoS、流量工程和网络恢复等方面提供良好的支持。文章根据LOBS的基本原理,提出并详细阐述了它的网络构成和工作机制,最后指出了LOBS网络在流量工程和网络生存性方面相对其他光网络的优越性。