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.     

Performance analysis of wavelength assignment policies inall-optical networks with limited-range wavelength conversion

Previous analytic approaches for all-optical networks have only allowed a random wavelength assignment policy in spite of the fact that network performance can be improved by other wavelength assignment policies such as first-fit wavelength assignment. We develop an approximate analytic method to allow flexible wavelength assignment policies by virtue of a layered-graph approach. Our analysis is also applicable to the networks that wavelength conversion is limitedly provided. By comparing with simulation results, we show that our analytic approach has good accuracies when the number of wavelengths is not large. We also show that our analysis is applicable to general network topologies     

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

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

Nonblocking WDM switching networks with full and limited wavelength conversion

In previous years, with the rapid exhaustion of the capacity in wide area networks led by Internet and multimedia applications, demand for high bandwidth has been growing at a very fast pace. Wavelength-division multiplexing (WDM) is a promising technique for utilizing the huge available bandwidth in optical fibers. We consider efficient designs of nonblocking WDM permutation switching networks. Such designs require nontrivial extensions from the existing designs of electronic switching networks. We first propose several permutation models in WDM switching networks ranging from no wavelength conversion, to limited wavelength conversion, to full wavelength conversion, and analyze the network performance in terms of the permutation capacity and network cost, such as the number of optical cross-connect elements and the number of wavelength converters required for each model. We then give two methods for constructing nonblocking multistage WDM switching networks to reduce the network cost.     

Multicast connection capacity of WDM switching networks with limited wavelength conversion

Currently, many bandwidth-intensive applications require multicast services for efficiency purposes. In particular, as wavelength division multiplexing (WDM) technique emerges as a promising solution to meet the rapidly growing demands on bandwidth in present communication networks, supporting multicast at the WDM layer becomes an important yet challenging issue. In this paper, we introduce a systematic approach to analyzing the multicast connection capacity of WDM switching networks with limited wavelength conversion. We focus on the practical all-optical limited wavelength conversion with a small conversion degree d (e.g., d=2 or 3), where an incoming wavelength can be switched to one of the d outgoing wavelengths. We then compare the multicast performance of the network with limited wavelength conversion to that of no wavelength conversion and full wavelength conversion. Our results demonstrate that limited wavelength conversion with small conversion degrees provides a considerable fraction of the performance improvement obtained by full wavelength conversion over no wavelength conversion. We also present an economical multistage switching architecture for limited wavelength conversion. Our results indicate that the multistage switching architecture along with limited wavelength conversion of small degrees is a cost-effective design for WDM multicast switching networks.     

Performance tradeoffs of optical WDM switches using different shared limited-range wavelength conversion mechanisms

The effects of different wavelength conversion ranging configurations on the performance of Wavelength Division Multiplexing (WDM) optical switches are investigated. Any-to-Any, Any-to-Range, Range-to-Any, and Range-to-Range conversion ranging configurations are considered. These mechanisms provide important design alternatives for optical switches due to technological limitations in the implementation of full range wavelength conversion in an all-optical wavelength converter device. Limited-range wavelength converter (LRWC) is a more economical and practical solution for WDM based optical networks. Differences among the input and output side ranging mechanisms and their effects on conversion resource sharing, and consequently on performance, are investigated. Any- to-Range ranging configuration is the most efficient mechanism and it operates comparably to Any-to-Any, reducing the need for complex control algorithms. The results help determine the most efficient ranging configuration for all-optical crossconnect.     

基于PVWP的有限波长转换的Mesh—torus网络的性能分析

本文主要探讨了Mesh-torus网络中,部分网络节点使用有限波长转换技术给网络性能带来的影响。我们比较了在非泊松业务模型下,有限波长转换和全波长转换在阻塞率、转换增益和公平性方面的性能,发现基于PVWP方案时网络节点只需具有转换度为d=3的波长转换能力就能达到全波长转换的性能。因此,通过将PVWP和有限波长转换技术结合来降低网络成本是可行的。     

Waveband switching networks with limited wavelength conversion

We study reconfigurable multi-granular optical cross-connects (MG-OXCs) in waveband switching networks with limited wavelength conversion and propose a heuristic algorithm to minimize the number of used wavelength converters while reducing the blocking probability.     

Performance analysis of limited-range wavelength conversion in an OBS switch

We compute analytically burst blocking probabilities in an OBS switch when limited-range wavelength conversion is employed. Two separate queueing models are proposed and analyzed approximately; one for the case where the degree of conversion d is 1 or 2, another for large values of d. The arrival process of bursts is assumed to be an IDLE-ON process. The accuracy of these queueing models was tested against simulation. We show numerically that in order to keep the burst blocking probability within an acceptable level, the utilization of each wavelength has to be low.     

Fast tunable wavelength conversion for all-optical packet switching

We demonstrate a simple scheme to achieve fast tunable wavelength conversion over a wide spectral range. The wavelength conversion is obtained by four-wave mixing in a semiconductor optical amplifier using a double-pump scheme, 2048-bit sequences at 2.5 Gb/s, incoming at a given wavelength, are alternatively converted toward two different wavelengths for a total conversion interval of 20 nm. With this method, the time needed to change the destination wavelength is much shorter than the bit duration. This feature makes any guard-time spacing between packets unnecessary. Bit-error-rate measurements show that the process occurs with negligible penalties (less than 0.3 dB).     

Resources sharing in optical packet switches with limited-range wavelength converters

This paper compares selected optical packet switching architectures that use the wavelength conversion technique to solve the packet contention problem. The architectures are equipped with shared and limited-range wavelength converters (LRWCs). This paper focuses on two architectures: the shared per node (SPN) and the shared per output fiber (SPOF) architectures, in which the wavelength converters are SPN and output fiber, respectively. Packet loss probability is expressed as a function of the number of wavelength converters used, by means of analytical models validated by simulations. The analytical results show how the use of a reduced number of LRWCs with small range allows the switch to obtain the same performances of an architecture equipped with all of the wavelength converters and using a full wavelength conversion.     

Dynamic routing and wavelength assignment for limited-range wavelength conversion

We propose a dynamic routing and wavelength assignment algorithm in an all-optical network with limited-range wavelength conversions. For each randomly arrived request, the correlation of different wavelengths on different links in all possible routes is described by the wavelength weight in our algorithm. We try to assign wavelengths on each candidate route using a shortest-path algorithm based on the wavelength weight and choose the best as its route and wavelength assignment scheme. Numerical results obtained for NSFNET and a 12-node ring show that our algorithm can greatly reduce the blocking probability and the number of required conversions under uniform traffic or traffic dominated by larger hop routes.     

Segment shared protection in WDM networks with partial wavelength conversion

In this paper, we propose a novel approach of survivable routing for segment shared protection (SSP) in mesh wavelength division multiplexing networks with partial wavelength conversion capability, with which spare capacity is allocated dynamically for a given working lightpath. The survivable routing process is formulated into a shortest path searching problem on the transferred graph of cycles (TGC) and wavelength graph of paths (WGP).     

Dynamic load balancing in WDM packet networks with and without wavelength constraints

We develop load balancing algorithms for WDM-based packet networks where the average traffic between nodes is dynamically changing. In WDM-based packet networks, routers are connected to each other using wavelengths (lightpaths) to form a logical network topology. The logical topology may be reconfigured by rearranging the lightpaths connecting the routers. Our algorithms reconfigure the logical topology to minimize the maximum link load. In this paper, we develop iterative reconfiguration algorithms for load balancing that track rapid changes in the traffic pattern. At each reconfiguration step, our algorithms make only a small change to the network topology hence minimizing the disruption to the network. We study the performance of our algorithms under several dynamic traffic scenarios and show that our algorithms perform near optimally. We further show that these large reconfiguration gains are achievable in systems with a limited number of wavelengths.     

An evaluation of distributed wavelength provisioning in WDM optical networks with sparse wavelength conversion

Distributed wavelength provisioning is becoming one of the most important technologies for supporting next-generation optical networks. This paper describes the evaluation of the performance of distributed wavelength provisioning in wavelength-division-multiplexing (WDM) optical networks with sparse wavelength conversion (i.e., where wavelength conversion is available at only a subset of network nodes). Using the well-known destination-initiated reservation method as a case study, a highly accurate analytical model supported by comprehensive simulation validation is proposed. Both analytical and simulation results show that, in optical networks with distributed wavelength provisioning, sparse wavelength conversion still helps to significantly lower the connection-blocking probabilities. However, unlike that in centralized wavelength provisioning, sparse wavelength conversion may not easily achieve nearly the same performance as that of full wavelength conversion, especially under light traffic loads. This paper evaluates how the potential contribution of sparse wavelength conversion depends on different factors, such as the number of wavelength converters, the number of wavelength channels per fiber, the burstiness of traffic loads, and the network size, and discusses the influence of the signaling scheme.     

Time-efficient optimal wavelength assignment in optical WDM networks with conversion capability

In wavelength-routed optical networks (WRONs), a wavelength assignment algorithm which can optimally utilize wavelength converters is strongly desired. In this letter, for the first time, we propose a novel graph constructed with groups of available wavelengths, called lambda-runs, to obtain the least-conversion lightpaths easily by applying the shortest-path routing Dijkstra's algorithm. Simulations show that our algorithm is much more scalable than an existing optimal algorithm, and significantly improves the blocking performance, compared to modified first-fit algorithm.     

Analytical model of sparse-partial wavelength conversion in wavelength-routed WDM networks

Wavelength conversion is one of the key techniques to improve the blocking performance in wavelength-routed WDM networks. Given that wavelength converters nowadays remain very expensive, how to make effective use of wavelength converters becomes an important issue. In this letter, we analyze the sparse-partial wavelength conversion network architecture and demonstrate that it can significantly save the number of wavelength converters, yet achieving excellent blocking performance. Theoretical and simulation results indicate that, the performance of a wavelength-routed WDM network with only 1-5% off wavelength conversion capability is very close to that with full-complete wavelength conversion capability.     

The benefits of wavelength conversion in WDM networks withnon-Poisson traffic

The effects of wavelength conversion on wavelength routing optical networks with dynamic non-Poisson traffic are investigated. A model that characterizes any non-Poisson traffic by its first two moments is utilized. The arrival occupancy distribution of busy wavelengths for this model process is derived and is used to analyze the effects of wavelength conversion. The model predicts that traffic peakedness plays an important role in determining the blocking performance     

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

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

Wavelength assignment with sparse wavelength conversion for optical multicast in WDM networks

This paper addresses the problem of multicast wavelength assignment for sparse wavelength conversion (MWA-SWC) in wavelength-routed wavelength-division-multiplexing (WDM) networks. It aims to optimally allocate the available wavelength for each link of the multicast tree, given a sparse wavelength conversion network and a multicast request. To our knowledge, little research work has been done to address this problem in literature.In this paper, we propose a new technique called MWA-SWC algorithm to solve the problem. The algorithm first maps the multicast tree from the sparse conversion case to the full conversion case by making use of a novel virtual link method to carry out the tree mapping. The method provides a forward mapping to generate an auxiliary tree as well as a reverse mapping to recover the original tree. Applying the auxiliary tree, we propose a dynamic programing algorithm for the wavelength assignment (WA) aiming to minimize the number of wavelength converters (NWC) required. Simulation results show that our new algorithm outperforms both random and greedy algorithms with regard to minimizing the NWC. Testing on various scenarios by varying the number of wavelength conversion nodes in the tree has confirmed the consistency of the performance. The primary use of the MWA-SWC algorithm is for static traffic. However, it can also serve as a baseline for dynamic heuristic algorithms. Typically, the MWA-SWC algorithm will provide great benefit when the number of available wavelengths on each link of the multicast tree is relatively large and the performance advantage is significant.