ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Communications
Volume 25, Issue 17, 1 November 2002, Pages 1527-1535
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (217 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0140-3664(02)00087-7    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2002 Elsevier Science B.V. All rights reserved.

A distributed routing and wavelength assignment algorithm for real-time multicast in WDM networks

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Chuanhe Huanga, Xiaohua JiaCorresponding Author Contact Information, E-mail The Corresponding Author, a and Yongbing Zhangb

a Institute of Computer Science, Wuhan University, People's Republic of China

b Institute of Policy and Planning Science, University of Tsukuba, Japan


Received 6 April 2001; 
revised 19 December 2001; 
accepted 28 January 2002. 
Available online 7 May 2002.

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 Contact Information 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


Computer Communications
Volume 25, Issue 17, 1 November 2002, Pages 1527-1535
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.