A novel survivable routing algorithm for shared segment protection in mesh WDM networks with partial wavelength conversion

In this paper, a survivable routing algorithm is proposed for shared segment protection (SSP), called optimal self-healing loop allocation (OSHLA), which dynamically allocates spare capacity for a given working lightpath in mesh wavelength-division-multiplexing (WDM) networks with partial wavelength conversion capability. Two novel graph transformation approaches, namely graph of cycles and wavelength graph of paths, are introduced to solve this problem, in which the task of survivable routing is formulated as a series of shortest path searching processes. In addition to an analysis on the computation complexity, a suite of experiments is conducted to verify OSHLA on four networks with different topologies and traffic loads. We find that the blocking probability and computation complexity are dominated by the upper bound on the length of the working and protection segments. Comparison is made between OSHLA and four other reported schemes in terms of blocking probability. The results show that OSHLA can achieve the lowest blocking probability under the network environment of interest. We conclude that OSHLA provides a generalized framework of survivable routing for an efficient implementation of SSP in mesh WDM partial wavelength convertible networks. With OSHLA, a compromise is initiated by manipulating the upper bound on the length of working and protection segments such that the best performance-computation complexity gain can be achieved.     

Shared partial path protection in WDM networks with shared risk link groups

For 100% shared risk link group (SRLG) failure protection, conventional full path protection has to satisfy SRLG-disjoint constraints, i.e., its working path and backup path cannot go though the same SRLG. With the increase of size and number of SRLGs, capacity efficiency of conventional shared full path protection becomes poorer due to SRLG-disjoint constraints and the blocking probability becomes much higher due to severe traps. To solve these problems, we present a partial path protection scheme where SRLG-disjoint backup paths may only cover part of the working path. Full path protection becomes a special case of partial path protection, in which the backup path covers the full working path. By choosing the most survivable partial backup path as backup path, we can make the impact of SRLG failures as low as possible and accept as many as possible connection requests. Assuming every SRLG has the same probability to fail, we present a heuristic algorithm to find the most survivable partial backup path by choosing full path protection first, iteratively computing partial backup paths and choosing the most survivable one. The benefit of this heuristic algorithm is that it can find the optimal results within less iteration. Analytical and simulation results show that, compared to conventional full path protection, our proposed scheme can significantly reduce blocking probability with little sacrifice on survivability. The proposed scheme is very useful particularly when the network contains a lot of SRLGs and the blocking probability of conventional full path protection becomes too high.

Hybrid protection in WDM networks with shared risk link groups

In wavelength-division multiplexing net- works with shared-risk link groups (SRLGs), it remains as a challenge to provide network protections with low-blocking probabilities and short average protection-swi- tching time. Based on the observation that in networks with SRLGs, link protection frequently helps avoid over-long backup routes and traps, we propose a novel hybrid protection scheme, with the objective of combining the high-average capacity efficiency of shared-path protection with the fast recovery and simple trap avoidance of shared-link protection. Extensive simulation results show that the proposed scheme steadily achieves lower blocking probabilities than both the shared-path and the shared-link protections, while the average protection-switching time is shortened as well. Meanwhile, the signaling and control procedures of the proposed scheme are kept with reasonable complexities.A short summarized version of this paper was presented at ECOC’2005, Sept. 2005, Glasgow, UK.     

WDM光网络中支持QoS的波长分配算法

基于在波长可变光网络中的波长分层图模型,本文提出了一种在动态业务情况下的支持不同QoS要求的路由波长分配算法,根据客户层业务不同的QoS要求,通过分层图模型中参数的不同取值,对其光路建立请求区别对待,提供不同级别的光路建立.仿真结果表明该算法具有很好的性能,提高了全网的资源利用率,满足了客户层业务在建立光通路时不同的QoS要求对网络阻塞率的要求.     

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.     

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.     

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.     

Path-based routing provisioning with mixed shared protection in WDM mesh networks

In this paper, the authors focus on studying the problem of survivable routing provisioning to prevent single link failure in wavelength-division-multiplexing (WDM) mesh networks, and propose a novel protection scheme called mixed shared path protection (MSPP). With MSPP, the authors define three types of resources: 1) primary resources that can be used by primary paths; 2) spare resources that can be shared by backup paths; and 3) mixed resources that can be shared by both the primary and the backup paths. In the proposed protection scheme, each connection is assigned a primary path and a link disjoint backup path. Differing from pervious protection schemes, MSPP allows some primary paths and backup paths to share the common mixed resources if the corresponding constraints can be satisfied. In this paper, the authors consider three types of path-based protection schemes, i.e., dedicated path protection (DPP), shared path protection (SPP), and MSPP, and evaluate their performance for both the static and the dynamic provisioning problems. Simulation results show that MSPP outperforms DPP and SPP.     

Power-aware provisioning strategy with shared path protection in optical WDM networks

As the Internet continues to grow, the power consumption of telecommunication networks is rising at a considerable speed, which seriously increases the operational expenditure and greenhouse gas emission. Since optical Wavelength Division Multiplexing (WDM) networks are currently the most promising network infrastructures, power saving issue on these networks has received more attention in recent years. In traditional optical WDM networks, a large amount of power is drained by the redundant idle resources and reserved backup resources although these powered on resources do not carry traffic in most of the time. In order to reduce the network power consumption, turning off the corresponding network components or switching them to a low-power, standby state (or called sleep mode) is a promising greening approach. In this paper, we study the power-aware provisioning strategies and propose a sleep mode based Power-Aware Shared Path Protection (PASPP) heuristic algorithm to achieve the power efficiency of optical WDM networks. By jointly utilizing link-cost and fiber-cost in path routing, resource assignment, and resource release, PASPP makes working paths and backup paths converge on different fibers as much as possible, and switch idle and backup components to sleep mode to realize power saving. Simulation results show that our PASPP can obtain notable power saving and achieve satisfactory tradeoff between power efficiency and blocking probability with respect to Power-Unaware Shared Path Protection (PUSPP).     

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.     

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     

Traffic grooming for survivable WDM networks - shared protection

We investigate the survivable traffic-grooming problem for optical mesh networks employing wavelength-division multiplexing (WDM). In the dynamic provisioning context, a typical connection request may require bandwidth less than that of a wavelength channel, and it may also require protection from network failures, typically fiber cuts. Based on a generic grooming-node architecture, we propose three approaches for grooming a connection request with shared protection: protection-at-lightpath level (PAL); mixed protection-at-connection level (MPAC); separate protection-at-connection level (SPAC). In shared-mesh protection, backup paths can share resources as long as their corresponding working paths are unlikely to fail simultaneously. These three schemes explore different ways of backup sharing, and they trade-off between wavelengths and grooming ports. Since the existing version of the problem for provisioning one connection request with shared protection is NP-complete, we propose effective heuristics. Under today's typical connection-bandwidth distribution where lower bandwidth connections outnumber higher bandwidth connections, we find the following: 1) it is beneficial to groom working paths and backup paths separately, as in PAL and SPAC; 2) separately protecting each individual connection, i.e., SPAC, yields the best performance when the number of grooming ports is sufficient; 3) protecting each specific lightpath, i.e., PAL, achieves the best performance when the number of grooming ports is moderate or small.     

Delay-constrained survivable multicast routing problem in WDM networks with shared segment-based protection

For a delay-constrained multicast transmission request, the goal of delay-constrained survivable multicast routing problem is to provide the primary multicast tree and the tree protecting sparse resources. The shared segment-based protection (SSBP) method is used in this article to protect the delay-constrained multicast transmission. Two heuristic methods are proposed to find the delay-constrained primary tree and the backup segments with delay constraint. Experiments are conducted to evaluate the performance of the proposed methods, and the performance to be evaluated includes wavelength efficiency ratio (WER), blocking ratio (BR), and executing time. Simulations show that the SSBP method can get better BR and WER than the previous results demonstrated Din and Jiang (Comput Commun 35(10):1172–1184, 2012).     

Performance modeling of bufferless WDM packet switching networks with limited-range wavelength conversion

All optical communication is attracting more and more attention because of the huge bandwidth of optics. In this paper, we study the performance of bufferless optical wavelength-division multiplexing (WDM) packet switching networks with limited-range wavelength conversion capabilities. We first introduce an optimal scheduling algorithm that maximizes the throughput of the switch. We then derive an analytical model to evaluate the performance of the switch in terms of packet-loss probability. Our model is the first accurate analytical model for a bufferless WDM packet switch with variable conversion distances, and can be used to quantitatively determine the maximum load for a given conversion distance or the minimum conversion distance for a given traffic load. We also conducted simulations to validate the analytical model. Both the analytical and simulation results reveal that limited-range wavelength conversion can achieve almost the same performance as full-range wavelength conversion.     

WDM光网络中一种新型的动态共享保护算法

波分复用(WDM)光网络中引入了共享风险链路组(SRLG)的概念 ,要求工作通路与保护通路不能处于同一个SRLG之中.文章提出了一种基于SRLG限制的动态共享通道保护算法,即满足K对业务的动态链路权重配置(K-Dynamic Link Weight Configuration, K-DLWC)算法 ,该算法的     

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.     

MDP-based lightpath establishment for service differentiation in all-optical WDM networks with wavelength conversion capability

In this paper, we propose a service differentiation method for lightpath establishment in all-optical WDM networks. The proposed method derives the optimal lightpath establishment policy for each serve class based on a Markov Decision Process (MDP). The optimal policy considered here is to provide service differentiation for lightpath establishment and to utilize wavelengths effectively. Here, we focus on two cases for wavelength conversion capability; full-range wavelength conversion and limited-range wavelength conversion. For full-range wavelength conversion, the number of lightpaths for each class is considered as a state of MDP. On the other hand, for limited-range wavelength conversion, the service class of lightpath that has been established with each output wavelength is considered as the state. Based on these states, we derive the optimal policy for lightpath establishment. In both cases, we evaluate the performance of the proposed method with simulation. In numerical examples, we show that our proposed method can provide service differentiation and use wavelengths effectively regardless of wavelength conversion capability.     

Blocking performance analysis on adaptive routing over WDM networks with finite wavelength conversion capability

Analytical blocking probability analysis is important for network design. In this paper, we present an analytical model for the blocking probability analysis on adaptive routing over the WDM networks with finite wavelength conversion capability. Modeling the finite nature of wavelength conversion has been a difficult task. We make use of the idea of segmented route to handle the finite wavelength conversion property. In this approach, a route is divided into a number of segments separated by wavelength converting nodes. We then combine the single-link model and the overflow model to derive the network-wide blocking probability. There are two distinct features in our technique. First, a concept of segmented route is used. Second, link state is considered when calculating the traffic flow. The latter ensures that the analytical results match closely to practical network status. Extensive simulations show that the analytical technique is effective in modeling the blocking probability performance for sparse networks.