Wavelength rerouting in survivable WDM networks

Authors:
Yingyu Wan;Weifa Liang
Affiliations:
Department of Computer Science, The Australian National University, Canberra, ACT, Australia;Department of Computer Science, The Australian National University, Canberra, ACT, Australia
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 5
Cited 0

The complexity of finding two disjoint paths with min-max objective function

Discrete Applied Mathematics
Survivability of lightwave networks — path lengths in WDM protection scheme

Journal of High Speed Networks - Special issue on survivable optical networks - part II
Wavelength rerouting in optical networks, or the Venetian Routing problem

Journal of Algorithms
Wavelength Rerouting for On-line Multicast in WDM Networks

LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Efficient routing and wavelength assignment for reconfigurable WDM networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

One limitation of all-optical WDM networks is the wavelength continuity constraint imposed by all-optical cross-connect switches that requires the same wavelength be used on all the links along a path. With random arrivals and departures of connection requests, it happens quite often that a new request has to be blocked due to the fact that there are not enough available resources (e.g. wavelength) to accommodate the request. Wavelength rerouting, a viable and cost-effective method, which rearranges the wavelengths on certain existing routes to free a wavelength continuous route for the new request, has been proposed to improve the blocking probability. In this paper, we study a wavelength rerouting problem in survivable WDM networks as follows. Given a connection request, the problem is to find two link-disjoint paths from the source node to the destination node with an objective to minimize the number of existing routes that have to be wavelength-rerouted. We show that the problem is NP-hard if different wavelengths are assigned to the link-disjoint paths. Otherwise, a polynomial time algorithm is proposed.