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(kn+m+nlog(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 K>=2.

[1]  K. Mani Chandy,et al.  Distributed computation on graphs: shortest path algorithms , 1982, CACM.

[2]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[3]  Weifa Liang,et al.  Improved lightpath (wavelength) routing in large WDM networks , 2000, IEEE Trans. Commun..

[4]  N. Golmie,et al.  A differentiated optical services model for WDM networks , 2000, IEEE Commun. Mag..

[5]  Alastair D. McAulay.  Optical Computer Architectures: The Application of Optical Concepts to Next Generation Computers , 1991 .

[6]  J. W. Suurballe.  Disjoint paths in a network , 1974, Networks.

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

[8]  Chung-Lun Li,et al.  The complexity of finding two disjoint paths with min-max objective function , 1989, Discret. Appl. Math..

[9]  Alok Aggarwal,et al.  Efficient routing in optical networks , 1996, JACM.

[10]  David Hung-Chang Du,et al.  Distributed computing with high-speed optical networks , 1993, Computer.

[11]  Weifa Liang,et al.  Improved lightpath (wavelength) routing in large WDM networks , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[12]  Alastair D. McAulay,et al.  Optical computer architectures , 1991 .

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

[14]  A. S. Acampora,et al.  Partially reconfigurable multihop lightwave networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[15]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

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

[17]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .