An effective buffering architecture for optical packet switching networks

A novel optical buffering architecture for Optical Packet Switching (OPS) networks is proposed in this article. The architecture which adopts a fiber-sharing mechanism aims at solving the problem of using a large number of fiber delay lines that are used to solve resource contention in the core node in OPS networks. The new architecture employs fewer fiber delay lines compared to other simple architectures, but can achieve the same performance. Simulation results and analysis show that the new architecture can decrease packet loss probability effectively and achieve reasonable performance in average packet delay.

异步光分组交换网的流量建模

研究了异步光分组交换网的流量特性，提出了网络流量的解析模型和近似模型。研究表明，在采用计时门限光分组组装算法的情况下，如输入IP流具有短程相关特性(ShortRangeDependent)，则光分组的到达间隔时间呈负指数分布，光分组的长度趋于高斯分布。     

Node dimensioning in optical burst switching networks

Network dimensioning should be progressed for pursuing the ultimate efficiency of network system resources in order to satisfy target performance. This article studies node dimensioning as a method of resource optimization in optical burst switching (OBS) networks. OBS is a new switching technology for pursuing bufferless transparent optical networks by sending control packets prior to data burst in order to provision resources for the burst. However, the basic assumption of a bufferless node implies burst contention at a core node when more than two bursts attempt to move forward the same output simultaneously. Thus, burst contention is a critical performance metric and this article takes it into account as a constraint on node dimensioning and target performance. In this article, we first present node dimensioning issues for OBS networks. Two constraints from the transport plane and the control plane which affect burst contention are then introduced. The effect of the burst assembly process on node dimensioning is also presented. From numerical analysis, the optimal number of wavelengths in a link, which provides the lowest blocking probability, is obtained to suggest a guideline for node dimensioning.     

光分组交换系统的结构研究

对光分组交换系统的几种结构进行了分类和比较研究,介绍了已研制成功的2.5Gbit/s光ATM交换实验系统的结构,给出了测试波形图,说明了工作机理。     

核心通信网的光分组交换

文章首先简单说明了新一代通信网需要使用分级交换的由来。接着详细叙述了光分组交换在未来光通信网的应用，包括节点结构、分组格式、输入、输出接口和一些特别重要的技术，如再生、同步、信头处理、缓冲、空间交换和波长转换等。     

规则全光分组网络中偏射路由算法的分析

就在ShuffleNet和Manhattan Street Network两种规则网络中使用偏射路由算法后的网络性能以及允许一个时隙插入多个数据包对该算法的影响进行了分析。结果说明，偏射路由算法不仅能使网络得到较高的性能，而且发挥了网状网具有迂回路由的能力。当采用允许插入多个数据包的策略时，网络的吞吐量和平均跳转次数都有小幅度的增加。     

一种FDL和LRWC相结合的光分组交换网络的性能分析

研究了FDL和有限长波长转换器(LRWC)相结合的方法来解决异步变长的分组交换网中的冲突问题,对这种冲突解决方案建立了数学模型并进行了理论分析,提出了一个用于修正最佳延迟单元的公式,即在负载较大的情况下,我们要求延迟单元较小,这样可显著的降低在此交换网中的分组丢失率;对系统丢包率与负载、FDL数目和最佳延迟单元的关系进行了研究和讨论,结果表明:在同样的输入负载情况下,有限长波长转换器(LRWC)的引入可以降低缓存的数量;对延迟单元的修正可以大大降低丢包率,同时系统的性能较之单独使用FDL时有较大的改善。     

Architectures and performance of optical packet switching nodes for IP networks

As new bandwidth-hungry Internet protocol (IP) services are demanding more and more capacity, transport networks are evolving to provide a reconfigurable optical layer in order to allow fast dynamic allocation of wavelength-division-multiplexing (WDM) channels. To achieve this goal, optical packet-switched systems seem to be strong candidates as they allow a high degree of statistical resource sharing, which leads to an efficient bandwidth utilization. In this paper, we propose an architecture for optical packet-switched transport networks, together with an innovative switching node structure based on the concept of per-packet wavelength routing. The traffic performance of such node when loaded by a typical IP traffic is evaluated through computer simulation; packet loss probability and average delay performance are shown for various load conditions.     

Keeping the packet sequence in optical packet-switched networks

This paper deals with optical packet switches with limited buffer capabilities, subject to asynchronous, variable-length packets and connection-oriented operation. The focus is put on buffer scheduling policies and queuing performance evaluation. In particular a combined use of the wavelength and time domain is exploited in order to obtain contention resolution algorithms that guarantee the sequence preservation of packets belonging to the same connection. Four simple algorithms for strict and loose packet sequence preservation are proposed. Their performance is studied and compared with previously proposed algorithms. Simulation results suggest that by accepting some additional processing effort it is possible to guarantee very low packet loss probabilities while avoiding the out-of-sequence delivery.     

Packet loss analysis in optical packet-switched networks with limited deflection routing

We present an approximate analytical method for the evaluation of packet loss probability in synchronous optical packet-switched networks which operate under limited deflection routing with the contention resolution method based on priorities. Packets are lost because they are removed by nodes. They are removed because they experience too many deflections and stay prohibitively long in the network. Such packets have to be removed because they will be ignored by the transmission protocols (like TCP) and because the quality of their optical signal is unacceptable. Presented are results for the network in the topology of the torus of the two-dimensional grid, which operates at a steady state with the uniform load u, . The strength of our analysis is its novel mathematical approach, which is capable of providing very low packet loss probabilities. For the network composed of 100 nodes, we predict the packet loss probability as low as 10⁻⁹ or lower, while simulation provided results only at the order of 10⁻⁶. For a given permissible packet loss probability, our analysis provides the maximal network load and the number of allowed deflections. We verify the analysis with simulation in the cases for which simulation gave results.

光分组交换中的波长变换器配置研究

首先对波长变换器的功能及分类进行详细的论述,然后,对波长变换器的配置进行分析,总结出两种波长变换器配置方法,即独占式配置方法和共享式配置方法.针对独占式配置方法,本文使用仿真实验的方法研究了在不同类型的波长变换器下交换节点丢包性能的差异.本文还对独占式配置方法和共享式配置方法进行对比研究.     

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.     

Fixed point analysis of limited range share per node wavelength conversion in asynchronous optical packet switching systems

In this article, we study an asynchronous optical packet switch equipped with a number of wavelength converters shared per node. The wavelength converters can be full range or circular-type limited range. We use the algorithmic methods devised for Markov chains of block-tridiagonal type in addition to fixed-point iterations to approximately solve this relatively complex system. In our approach, we also take into account the finite number of fiber interfaces using the Engset traffic model rather than the usual Poisson traffic modeling. The proposed analytical method provides an accurate approximation for full range systems for relatively large number of interfaces and for circular-type limited range wavelength conversion systems for which the tuning range is relatively narrow.

A broad view on overspill routing in optical networks: a real synthesis of packet and circuit switching?

The emerging wavelength switched networks reduce the strain on packet forwarding. Unfortunately, that solution is not really efficient on a bandwidth level, and is not ideally suited for bursty traffic. Packet switched solutions, whether electronic or optical, can use statistical multiplexing to cope with bursty traffic and yield better bandwidth efficiency. We present a novel network concept that can combine these two worlds, withholding their advantages. We introduce this Overspill Routing In Optical Networks (ORION), and discuss several aspects of it: the overall architecture and network concept, node design and implementation, and evaluation at network level as well as node level.     

全光包交换系统的实现原理

描述了光包交换节点的结构,分析了网络的物理和逻辑的可行性,介绍了一个由40个网络节点组成的节点流量达160Gbit/s的物理网络,网络能提供较好的服务质量（包丢失率和包传输延迟）并兼容多种业务,这一结果为基于全光包交换技术的灵活性网络的研究铺平了道路。     

Some analytical tools for the global performance evaluation of packet switching networks based on virtual paths

We present a simple model for the global performance evaluation of a packet switching network. Through a detailed analytical treatment, a set of formulae is derived which allow a compact and reliable evaluation of the most significant statistical properties of the network, such as the arrival probabilities, the queue states distribution and the mean utilizations of the links. Starting from the knowledge of these quantities, the network can be characterized also taking into account the mutual interaction between different nodes. An example is given with reference to a mesh-connected structure.     

折射路由法在光分组交换网络中的运用

就OTDM(光时分复用)光分组交换网络的交换节点功能和关键技术进行了分析和探讨。对无缓冲折射路由法在街区网络上的应用和路由算法进行了深入研究，并根据概率分析模型，求得在稳定状态下吞吐量和平均时延的计算公式，最后与有缓冲区的存储转发网络的性能进行了比较。     

Design of an ultra fast pipelined wavelength scheduler for optical burst switching

Optical Burst Switching (OBS) is an emerging technology that allows variable size data bursts to be transported directly over DWDM links without encountering O/E/O conversion. In OBS, before the transmission of a data burst, a burst header is transmitted through an electronic control path, setting up and tearing down optical paths on-the-fly. Data bursts can remain in the optical domain and pass through the OBS network transparently. Unfortunately, system performance will be greatly degraded, if burst scheduling requests cannot be processed in time. This article quantitatively studied the negative impact of control path overloading on the performance of OBS networks. Results have shown that control path overloading greatly affects the performance of the OBS routers, especially for systems with large WDM channel counts. In order to remove this performance bottleneck, we have designed and implemented an ultra fast pipelined burst scheduler that is able to process a burst request every two clock cycles, regardless of the number of WDM channels per link. The design has been implemented in Verilog HDL and synthesized to FPGAs. Circuit level simulation results confirm the correctness of the design. The circuit has achieved 100 MHz in Altera Cyclone II devices, allowing the scheduler to process a burst request every 20 ns. To the authors’ best knowledge, this is the fastest implementation of burst scheduling algorithms.     

Multi-wavelength switching in IP optical nodes adopting different buffering strategies

The paper addresses the topic of long-haul optical networking for the provision of large-bandwidth IP services. A class of optical packet switching architectures is considered which adopts an arrayed wavelength grating device as packet router. The architecture performs slotted packet switching operations and fully exploits the wavelength routing capabilities by allowing multi-wavelength switching. Fiber delay lines are used to perform optical packet buffering, which accomplishes either input queueing or shared queueing. Here a thorough performance evaluation is carried out with different buffering configurations and the effect of various switch parameters on traffic performance is studied.     

FB-banyans and FB-delta networks: Fault-tolerant networks for broadband packet switching

Many fast packet switches for the broadband integrated services digital network (BISDN) in the literature are based on banyan networks. Although banyan networks possess nice properties such as a simple control and a low hardware cost, they are unique-path networks. Since there is a unique path from an input to an output in a banyan network, a single component failure may disrupt services of some nodes connected to such a network. Moreover, banyan networks are also blocking networks; packets can be lost within the networks. To reduce the packet loss, buffered banyan networks can be used. In an earlier work we have proposed the addition of backward links to otherwise unidirectional banyan networks to create B-banyans (and B-delta networks). Backward links not only function as implicit buffers for blocked packets, but also provide multiple paths for each input-output connection. However, the multiple paths in B-banyans may not be disjoint. In this paper, we enhance B-banyans and B-delta networks in such a way that the resulting networks can provide disjoint multiple paths for each input-output pair. The existence of disjoint multiple paths has a significant effect on the network fault-tolerance. The new networks, called FB-banyans and FB-delta networks, are k fault-tolerant, where k is the number of backward links per switch and is less than the switch size. They are also robust to more than k faults, depending on the locations of faults. The maximal fault-tolerance is achieved when k is the switch size minus 1. The performance of the new networks is analysed and compared to that of other networks of interest. FB-banyans and FB-delta networks can be used as a switch fabric for fast packet switches to provide performance comparable to that of buffered banyan networks and good fault tolerance.