Finding Multiple Routing Paths in Wide-Area WDM Networks

In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpaths from a source to a destination, if they exist, such that they meet some specified optimization objective. Two versions of the problem are studied. One is to minimize the total cost of the K paths, and the other is to minimize the cost of the maximum cost one among the K paths. An efficient algorithm for the first version is proposed, which takes OðkKðknCmCn logðknÞÞÞ time and delivers an exact solution, where n, m, and k are the number of nodes, links and wavelengths in the network, respectively. The second version of the problem is shown to be NP-hard, instead an approximation algorithm is devised which delivers a solution within K times of the optimum, where KR2. q 2005 Elsevier B.V. All rights reserved.

• Type: Conference
• Year: 2002
• Where: ICPPW
• Authors: Weifa Liang, Xiaojun Shen
• Keywords: ICPPW 2002, Routing Path Problem, Total Cost, Wavelength Division Multiplexing