A time optimal wavelength rerouting algorithm for dynamic traffic in WDM networks

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 ran improve the blocking performance by rearranging certain existing lightpaths to accommodate a new request. Recently, 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/sup 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 that it requires O(N/sup 3/W+N/sup 2/W/sup 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.

[1]  Imrich Chlamtac,et al.  Lightpath (Wavelength) Routing in Large WDM Networks , 1996, IEEE J. Sel. Areas Commun..

[2]  S. Okamoto,et al.  Architectural analysis of multiple fiber ring networks employing optical paths , 1997 .

[3]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[4]  Alexander Birman,et al.  Routing and wavelength assignment methods in single-hop all-optical networks with blocking , 1995, Proceedings of INFOCOM'95.

[5]  Anthony S. Acampora,et al.  Benefits of Wavelength Translation in All-Optical Clear-Channel Networks , 1996, IEEE J. Sel. Areas Commun..

[6]  Pierre A. Humblet,et al.  Models of Blocking Probability in All-Optical Networks with and Without Wavelength Changers , 1995, IEEE J. Sel. Areas Commun..

[7]  Biswanath Mukherjee,et al.  A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..

[8]  Suresh Subramaniam,et al.  All-optical networks with sparse wavelength conversion , 1996, TNET.

[9]  S. Baroni,et al.  Wavelength requirements in arbitrarily connected wavelength-routed optical networks , 1997 .

[10]  Kumar N. Sivarajan,et al.  Routing and wavelength assignment in all-optical networks , 1995, TNET.

[11]  Vincent W. S. Chan,et al.  All-Optical Network Consortium - Ultrafast TDM Networks (Invited Paper) , 1996, IEEE J. Sel. Areas Commun..

[12]  R. Ramaswami,et al.  Multiwavelength lightwave networks for computer communication , 1993, IEEE Communications Magazine.

[13]  K. Lee,et al.  A wavelength rerouting algorithm in wide-area all-optical networks , 1996 .

[14]  N. Nagatsu,et al.  Optical Path Cross-Connect System Scale Evaluation Using Path Accommodation Design for Restricted Wavelength Multiplexing , 1996, IEEE J. Sel. Areas Commun..