Optimization of wavelength assignment for QoS multicast in WDM networks

This paper discusses quality-of-service (QoS) multicast in wavelength-division multiplexing (WDM) networks. Given a set of QoS multicast requests, we are to find a set of cost suboptimal QoS routing trees and assign wavelengths to them. The objective is to minimize the number of wavelengths in the system. This is a challenging issue. It involves not only optimal QoS multicast routing, but also optimal wavelength assignment. Existing methods consider channel setup in WDM networks in two separate steps: routing and wavelength assignment, which has limited power in minimizing the number of wavelengths. In this paper, we propose a new optimization method, which integrates routing and wavelength assignment in optimization of wavelengths. Two optimization algorithms are also proposed in minimizing the number of wavelengths. One algorithm minimizes the number of wavelengths through reducing the maximal link load in the system; while the other does it by trying to free out the least used wavelengths. Simulation results demonstrate that the proposed algorithms can produce suboptimal QoS routing trees and substantially save the number of wavelengths.

[1]  L. H.,et al.  Communication Networks , 1936, Nature.

[2]  Aravind Srinivasan,et al.  A survey of the role of multicommodity flow and randomization in network design and routing , 1997, Randomization Methods in Algorithm Design.

[3]  Leland L. Beck,et al.  Smallest-last ordering and clustering and graph coloring algorithms , 1983, JACM.

[4]  Philip N. Klein,et al.  Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts , 1994, SIAM J. Comput..

[5]  Samir Khuller,et al.  Balancing minimum spanning and shortest path trees , 1993, SODA '93.

[6]  Rajesh K. Pankaj.  Wavelength requirements for multicasting in all-optical networks , 1999, TNET.

[7]  Biswanath Mukherjee,et al.  Optical Communication Networks , 1997 .

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[10]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[11]  Xiaohua Jia,et al.  A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks , 1998, TNET.

[12]  Eli Upfal,et al.  Efficient routing in all-optical networks , 1994, STOC '94.

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

[14]  Peter Winkler,et al.  Ring routing and wavelength translation , 1998, SODA '98.

[15]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[16]  Biswanath Mukherjee,et al.  Light trees: optical multicasting for improved performance in wavelength routed networks , 1999, IEEE Commun. Mag..