IP voer WDM光网络及其生存性问题讨论

本文介绍了IP voer WDM光网络的演进过程与发展趋势；讨论了其生存性问题，包括光层生存性有关概念、分类及各自的优缺点，IP/MPLS层与WDM层联合生存机制的必要性以及这种联合机制需要解决的竞争问题=带宽资源共享问题和失效扩散问题等。     

WDM光突发交换网中的生存性问题

光突发交换拥有光电路交换和光分组交换两种方式的主要特征,是未来光网络的一种有希望的实现形式,本文对wDM光突发交换网络的实现做了简要的介绍,主要从wDM光突发交换网络的生存性出发对相关问题进行了分析研究,并提出了相应的解决方案.     

影响波长转换器改善WDM网络性能的因素

分析了影响波长转换器改善WDM网络性能的各种因素,并且给出了多种衡量波长转换器改善WDM网络性能的重要参数。     

Configuration of p-Cycles in WDM Networks with Partial Wavelength Conversion

The p-cycle concept offers a capacity-efficient and rapid protection mechanism for mesh-restorable networks. This work investigates the configuration of span protecting p-cycles in wavelength division multiplexing (WDM) networks with limited wavelength conversion. An important point of view is the relation between the costs associated with the number of required wavelength converters, and the protection capacity-efficiency achieved. We formulate mathematical models and solve the respective optimization problems for a pan-European network as a test-case. An interesting finding is that the total number of converters required for the network as a whole can be greatly reduced, with only a small increase in spare capacity for protection by a strategy of associating wavelength converters with the access points between a pure wavelength path (WP) working layer and a set of pure WP p-cycle protection structures.     

Performance Analysis of Distributed Protocols for Bidirectional Wavelength Reservations in Dynamic WDM Networks

In this paper, we present an analytical model to investigate the blocking performance of distributed wavelength reservation protocols in dynamic WDM networks. This model extends the approach of [S. Arakawa et al., Proceedings of ITC-CSCC, (Sado, Japan, July 1999), pp. 828--831] in two aspects: firstly we take into account the contention between the two end nodes of bidirectional links in bidirectional wavelength reservations. Secondly, we make a distinction between the effects of different kinds of network delays, which include signaling transmission delay, signaling processing delay, and optical cross-connects (OXC) operation delay. As an application, we use our method to analyze the performance of two different signaling processing schemes, namely forward after cross-connect (FAXC) and forward before cross-connect (FBXC) [M. Goyal et al., Technical Digest of OFC2002 (Anaheim, CA, Mar. 2002) pp. 489--490]. The accuracy of our analytical model is validated by discrete-event simulations. Numerical results show that the FBXC scheme can give a lower network blocking probability than FAXC, and the efficiency of FBXC becomes more significant as the OXC operation delay increases.     

A Novel Fast Multicast Algorithm with Enhanced Survivability in WDM Optical Networks

WDM optical networking technology is expected to facilitate bandwidth-intensive multicast application by establishing a light-tree which regards the source node as the root and all the destination nodes as the leaves. However, the existing multicast routing algorithms are time-consuming and the generated light-trees are very sensitive to failures, e.g., a single fiber cut can disrupt the information from transmitting to several terminals. In this paper, we propose a novel fast multicast algorithm with enhanced survivability (FMES), which applies a two-stage multicast routing approach, and employs a path protection scheme for each segment of the first stage tree. Analysis and experimental results show that FMES has the significant advantage of a much shorter running time than that in existing schemes, and this advantage can be enlarged in the distributed routing and signaling system of the coming intelligent optical networks. We also compare FMES with non-protection and full-protection schemes. It shows that the FMES scheme achieves the best trade-off between network survivability and resource-utilization. We illustrate our study with numerical experiments based on the real-life ChinaNet topology.     

Performance Study of Distributed Wavelength Reservation Protocols within Both Single and Multi-Fiber WDM Networks

Distributed wavelength reservation protocols are employed to dynamically set up and tear down lightpaths in WDM networks. In this paper, discrete event-driven simulations are carried out to investigate the performance of different protocols under both single and multi-fiber circumstances. Simulation results indicate that the behavior of these protocols varies noticeably between single and multi-fiber networks. Discussions on these results are also presented. It is found that the preferred scheme in the literature, which adopts backward reservation with random wavelength selection, does well in single-fiber scenarios. But this scheme fails to be excellent in multi-fiber scenarios since it cannot take full advantage of multiple fibers. Then, we extend the reservation protocols for multi-fiber networks and propose a novel wavelength selection policy called Maximum-Availability policy. Results show that our scheme will give an outstanding performance in both single and multi-fiber networks.     

Dimensioning of the Wavelength Converters in a WDM Optical Packet Switch

This paper analyzes the performances of a WDM optical packet switch making use of fiber delay lines to resolve output packet contentions; the optical packet switch is equipped with tunable wavelength converters which can shift optical packets to any wavelength of the output link which they are directed to. As not all packets need conversion, we propose a dimensioning technique allowing to reduce the number of converters and to improve the signal quality by reducing unnecessary conversions. The obtained results show that a remarkable reduction of the number of converters is obtained with respect to that needed by other switches described in literature. Such a saving is achieved by maintaining the packet loss probability below a prefixed threshold.     

业务量疏导WDM网状网中的动态子通路保护算法

该文研究了业务量疏导WDM网状网中的生存性问题,提出一种自适应子通路保护(ASPP)算法。该算法根据网络当前状态以及到达业务连接请求的带宽要求动态调整链路权值;在此基础上选择一条最短路作为工作通路,然后将该通路分为互不重叠的n段子通路(每段经过的链路数为m),并分别找出各自的保护通路。仿真结果表明：ASPP既可以保证业务连接的可靠性要求,同时又允许网络管理者根据一定优化策略调整m值,从而可以在资源利用率和恢复时间之间进行折中。     

Performance Analysis of Multi-Fiber WDM Network with Limited-Range Wavelength Conversion

Wavelength routed optical networks have emerged as a technology that can effectively utilize the enormous bandwidth of the optical fiber. Wavelength conversion technology and wavelength converters play an important role in enhancing fiber utilization and in reducing the overall call blocking probability of the network. In this paper, we develop a new analytical model to calculate the average blocking probability in multi-fiber link networks using limited range wavelength conversion. Based on the results obtained, we conclude that the proposed analytical model is simple and yet can effectively analyze the impact of wavelength conversion ranges and number of fibers on network performance. Also a new heuristic approach for placement of wavelength converters to reduce blocking probabilities is explored. Finally, we analyze network performance with the proposed scheme. It can be observed from numerical simulations that limited range converters placed at a few nodes can provide almost the same blocking probability as full range wavelength converters placed at all the nodes. We also show that being equipped with a multi-fiber per-link has the same effect as being equipped with the capability of limited range wavelength conversion. So a multi-fiber per-link network using limited range wavelength conversion has similar blocking performance as a full wavelength convertible network. Since a multi-fiber network using limited range wavelength conversion could use fewer converters than a single-fiber network using limited range wavelength conversion and because wavelength converters are today more expensive than fiber equipment, a multi-fiber network in condition with limited range wavelength conversion is less costly than a single fiber network using only limited range wavelength conversion. Thus, multi-fiber per-link network using limited range wavelength conversion is currently a more practical method for all optical WDM networks. Simulation studies carried out on a 14-node NSFNET, a 10-node CERNET (China Education and Research Network), and a 9-node regular mesh network validate the analysis.     

多光纤波分复用网动态路由和波长分配算法

本文研究了多光纤波分复用光互连网的动态路由和波长分配问题,提出了基于分层图模型的两种动态路由算法,LG-1和LG-2.这两种算法将路由和波长分配问题转换为如何在分层图中支持尽可能多的光路.这使得设计者可以同时考虑路由和波长分配子问题,从而取得了更好的效果.计算机仿真表明基于分层图的算法大大优于传统的固定路由和动态路由算法.     

Performance Analysis of WDM Optical Networks with Wavelength Usage Constraint

Due to power considerations, it is possible that not all wavelengths available in a fiber can be used at a given time. In this paper, an analytical model is proposed to evaluate the blocking performance of wavelength-routed optical networks with and without wavelength conversion where the usable wavelengths in a fiber is limited to a certain maximum number, referred to as wavelength usage constraint. The effect of the wavelength usage constraint is studied on ring and mesh-torus networks. It is shown that the analytical model closely approximates the simulation results. We also evaluate the performance of the first-fit wavelength assignment algorithm and compare its performance with the random wavelength assignment algorithm through simulation. It is observed that increasing the total number of wavelengths in a fiber is an attractive alternative to wavelength conversion when the number of usable wavelengths in a fiber is maintained the same.     

Ant Colony Optimization for Dynamic RWA in WDM Networks with Partial Wavelength Conversion

Dynamic routing and wavelength assignment (RWA), which supports request arrivals and lightpath terminations at random times, is needed for rapidly changing traffic demands in wavelength division multiplexed, (WDM) networks. In this paper, a new distributed heuristic algorithm based on ant colony optimization for dynamic RWA is put forward. We consider the combination of route selection and wavelength assignment as a whole using a multilayer-graph model. Therefore, an extended multilayer-graph model for WDM networks with limited wavelength conversion is presented. Compared with other RWA methods, the Ant Colony heuristic algorithm can achieve better global network optimization and can reduce communication overhead cost of the networks. Simulation showed that a lower blocking probability and a more rational wavelength resource assignment can be achieved.     

Wavelength Conversion in WDM Optical Networks: Strategies and Algorithms for Limiting the Number of Converters in the Optical Cross-Connects

This paper considers the problem of wavelength conversion in optical networks using wavelength division multiplexing technique. In the previous literature, two main wavelength routing and assignment strategies have been introduced: wavelength path (WP) and virtual wavelength path (VWP), depending on whether the signal stays on the same wavelength or is converted to another during its travel throughout the network. While the former method does not require any wavelength conversion, the latter needs wavelength conversion in each optical node and, in particular, a wavelength converter per each signal handled by the node itself. From the previous literature emerged that the VWP leads to optical cross-connect (OXC) with lower dimensions compared to the ones required by the WP scheme, and that the difference between the WP and VWP schemes increases as the number of wavelengths carried by each fiber increases. In this paper a new strategy is introduced, named partial virtual wavelength path (PVWP), with the related wavelength routing and assignment algorithm, which makes limited use of wavelength conversion compared to the VWP scheme, and allows the same advantages of VWP to be attained with lower OXC dimensions. The paper reports a comparative analysis among the different strategies, considering both the cases of a network without failures and a network with the possibility of failure restoration. The main result is that the proposed PVWP strategy allows the same advantages of the VWP scheme with a strongly reduced number of wavelength converters (around 5% of the number required by VWP scheme). This figure does not vary appreciably if failure restoration is considered. The new strategy can be adopted by using an opportune OXC architecture, as illustrated in the paper, which allow a limited number of converters to be shared among all the channels as a common pool.     

多约束条件下WDM光网中多播选路和波长分配算法

在光层构建多播选路和波长分配时,必须考虑一些约束条件。主要的约束条件有以下4种：稀疏分光器配置约束、波长连续性约束、能量损伤约束及稀疏波长转换器约束。目前,研究人员只是针对其中一个或两个约束条件进行了算法研究。该文在详细分析各种约束条件之后,提出了一种基于多约束条件下多播选路和波长分配启发式算法。最后在CERNET和NSFNET两种网络拓扑上进行了仿真实验。根据算法仿真结果可以得出该算法可以有效地解决多约束条件下的多播路由及波长分配问题。     

Design and Performance Evaluation of a Separated Control Signaling Protocol for WDM Optical Networks

In WDM optical networks, an efficient control signaling protocol is required to dynamically establish lightpaths. This paper proposes a separated control signaling protocol (SCSP) and compares the performance of SCSP with a conventional integrated control signaling protocol (ICSP). The conventional ICSP makes reservations sequentially from the source to the destination for setting up and tearing down lightpaths. It increases the control overhead and wastes the network resource if it cannot reserve the network resource at an intermediate node. Specifically, if the receiver at the destination is not available after successful reservation at intermediate nodes, it wastes a lot of bandwidth. It causes decreasing chances of reservation for other lightpaths. Instead, SCSP separates bearer control from call control to reduce the waste of network resources. The call control function checks the availability of network resources such as wavelengths and receivers. Bearer control reserves, allocates, and releases network resources. To evaluate the performance of the two protocols, they are mathematically analyzed using a probabilistic model. Simulation results are also provided to compare the proposed protocol with the conventional ICSP in terms of utilization and blocking probability. From the results of simulation and iterative analysis, we can observe that SCSP performs better than ICSP.     

OPTIMIZATION OF WDM OPTICAL PACKET SWITCHES WITH SPARSE WAVELENGTH CONVERTERS AND NON-DEGENERATE FIBER DELAY-LINES

This paper investigates the untraditional approach of contention resolution in Wavelength Division Multiplexing (WDM) Optical Packet Switching (OPS). The most striking characteristics of the developed switch architecture are: (1) Contention resolution is achieved by a combined sharing of Fiber Delay-Lines (FDLs) and Tunable Optical Wavelength Converters (TOWCs); (2) FDLs are arranged in non-degenerate form, i.e., non-uniform distribution of the delay lines; (3) TOWCs just can perform wavelength conversion in partial continuous wavelength channels, i.e., sparse wavelength conversion. The concrete configurations of FDLs and TOWCs are described and analyzed under non-bursty and bursty traffic scenarios. Simulation results demonstrate that for a prefixed packet loss probability constraint, e.g., 10-6, the developed architecture provides a different point of view in OPS design. That is, combined sharing of FDLs and TOWCs can, effectively, obtain a good tradeoff between the switch size and the cost, and TOWCs which are achieved in sparse form can also decrease the implementing complexity.     

Performance of Adaptive Routing in Wavelength-Routed Networks with Wavelength Conversion Capability

This paper concerns itself with the performance of adaptive routing in wavelength-routed networks with wavelength conversion capability. Exploiting the concept of load balancing, we propose an adaptive weighted-shortest-cost-path (WSCP) routing strategy. The salient feature of WSCP is that it seeks the path that minimizes the resource cost while simultaneously maintaining the traffic load among the links as balanced as possible. In our simulation, we compare the blocking probability, average hops and link utilization of WSCP with traditional shortest-cost-path (SCP) strategy, fixed routing and alternate routing. The numerical results show that WSCP can enhance blocking performance and just lengthen hop distances a little longer. The improvement is more significant in denser networks or with more wavelengths. We also develop an analytical model to estimate blocking performance of WSCP and compare analyses with simulations. Because of the benefit from load balancing, the proposed WSCP strategy can be used as a path selection algorithm in traffic engineering.     

Cost Effective Shared Path Protection for WDM Optical Mesh Networks with Partial Wavelength Conversion

In this paper, we study routing and wavelength assignment of connection requests in survivable WDM optical mesh networks employing shared path protection with partial wavelength conversion while 100% restorability is guaranteed against any single failures. We formulate the problem as a linear integer program under a static traffic model. The objective is to minimize the total cost of wavelength-links and wavelength converters used by working paths and protection paths of all connections. A weight factor is used which is defined as the cost ratio of a wavelength converter and a wavelength-link. Depending on the relative cost of bandwidth and wavelength conversion, the optimization objective allows a proper tradeoff between the two. The proposed algorithm, the shortest-widest-path-first (SWPF) algorithm, uses a modified Dijkstra's algorithm to find a working path and a protection path for each connection request in the wavelength graph transformed from the original network topology. When there are multiple candidate paths that have the same minimum total cost, the path along which the maximum number of converters used at each node is minimized is chosen by the SWPF algorithm. We have evaluated the effectiveness of the proposed algorithm via extensive simulation. The results indicate that the performance of the proposed algorithm is very close to that of the optimal solutions obtained by solving the ILP formulation and outperforms existing heuristic algorithms in terms of total number of converters used and the maximum number of converters required at each node in the network. The proposed algorithm also achieves slightly better performance in terms of total cost of wavelength-links and converters used by all connections. We also investigated shared path protection employing converter sharing. The results show that the technique can reduce not only the total number of converters used in the network but also the maximum number of converters required at each node, especially when a large number of converters are needed in the network. In this study, although the ILP formulation is based on static traffic, the proposed algorithm is also applicable to routing dynamic connection requests.     

OCDM/WDM多跳光网络及其端到端误码率性能研究

采用码分复用与波分复用相结合的技术可以构成基于波长和码字转换的多跳光网络。只考虑码字转换,首先给出了光码分复用/波分复用多跳光网络的构成方法和码字转换器的一般结构,然后分析了网络中端到端的误码率性能。计算结果表明:码字转换次数的增加对端到端误码率的影响较小;当接收端的干扰信道数小于前一码字转换阶段的干扰信道数时,端到端误码率与判决阈值的关系曲线在最小值附近出现一近水平区间。