Copyright © 2002 Elsevier Science B.V. All rights reserved.
A distributed routing and wavelength assignment algorithm for real-time multicast in WDM networks
Received 6 April 2001;
Abstract
Routing and wavelength assignment for online real-time multicast connection setup is a difficult task due to the dynamic change of availabilities of wavelengths and the consideration of wavelength conversion delay in wavelength division multiplexing (WDM) networks. This paper presents a distributed routing and wavelength assignment scheme for the setup of real-time multicast connections. It integrates routing and wavelength assignment as a single process, which greatly reduces the connection setup time. The proposed routing method is based on the Prim's minimum spanning tree (MST) algorithm and the K-restricted breadth-first search method, which can produce a sub-minimal cost tree under a given delay bound. The wavelength assignment uses the least-conversion and load balancing strategies.
Author Keywords: Wavelength division multiplexing networks; Routing and wavelength assignment; Multicast routing; Delay bounded routing
Article Outline
- 1. Introduction
- 2. Problem formulation
- 3. Related work
- 4. The distributed algorithm
- 4.1. Overview of the proposed algorithm
- 4.2. Discussion of the algorithm
- 4.2.1. Data structures and notations
- 4.2.2. Construction of Ctree
- 4.2.3. Construction of Dtree
- 4.2.4. Merging of Ctree and Dtree
- 4.3. Illustration of our algorithm
- 4.4. Algorithm analysis
- 5. Simulations
- 6. Conclusions
- Acknowledgements
- References
Corresponding author. Address: Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, People's Republic of China. Tel.: +852-2788-9670; fax: +852-2788-8614; email: jia@cs.cityu.edu.hk






E-mail Article
Add to my Quick Links

Cited By in Scopus (2)






