Abstract

In this paper, we consider wavelength rerouting in wavelength routed wavelength division multiplexed (WDM) networks with circuit switching, wherein lightpaths between source-destination pairs are dynamically established and released in response to a random pattern of arriving connection requests and connection holding times. The wavelength continuity constraint imposed by WDM networks leads to poor blocking performance. Wavelength rerouting is a viable and cost effective mechanism that can improve the blocking performance by rearranging certain existing lightpaths to accommodate a new request. Recently, in [1], a rerouting scheme called "parallel move-to-vacant wavelength retuning (MTV-WR)" with many attractive features such as shorter disruption period and simple switching control, and a polynomial time rerouting algorithm, for this scheme, to minimize the weighted number of rerouted lightpaths have been proposed. This paper presents a time optimal rerouting algorithm for wavelength-routed WDM networks with parallel MTV-WR rerouting scheme. The algorithm requires only {{O(N}}^{{2}}{{W)}} time units to minimize the weighted number of existing lightpaths to be rerouted, where { N} is the number of nodes in the network and { W} is the number of wavelength channels available on a fiber link. Our algorithm is an improvement over the earlier algorithm proposed in [1] that requires {{O(N}}^{{3}}{{W+N}}^{ {2}}{{W}}^{ {2}}{{)}} time units, which is not time optimal. The simulation results show that our algorithm improves the blocking performance considerably and only very few lightpaths are required to be rerouted per rerouting. It is also established through simulation that our algorithm is faster than the earlier rerouting algorithm by measuring the time required for processing connection requests for different networks.

[IEEE ]

Lightpath Rerouting Strategies in WDM All-Optical Networks Under Scheduled and Random Traffic

Mohamed Koubàa and Maurice Gagnaire
J. Opt. Commun. Netw. 2(10) 859-871 (2010)

Fairness in Zone-Based Algorithms for Dynamic Traffic Grooming in WDM Mesh Networks

André C. Drummond and Nelson L.S. da Fonseca
J. Opt. Commun. Netw. 2(6) 305-318 (2010)

Route Partitioning Scheme for Elastic Optical Networks With Hitless Defragmentation

Seydou Ba, Bijoy Chand Chatterjee, Satoru Okamoto, Naoaki Yamanaka, Andrea Fumagalli, and Eiji Oki
J. Opt. Commun. Netw. 8(6) 356-370 (2016)

Priority Based Routing and Wavelength Assignment With Traffic Grooming for Optical Networks

Bijoy Chand Chatterjee, Nityananda Sarma, and Partha Pritim Sahu
J. Opt. Commun. Netw. 4(6) 480-489 (2012)

Dynamic Multicast Traffic Grooming in Optical WDM Mesh Networks: Lightpath Versus Light-Tree

Xiaojun Yu, Gaoxi Xiao, and Tee-Hiang Cheng
J. Opt. Commun. Netw. 5(8) 870-880 (2013)