๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks

โœ Scribed by Xiao-Hua Jia; Ding-Zhu Du; Xiao-Dong Hu


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
204 KB
Volume
24
Category
Article
ISSN
0140-3664

No coin nor oath required. For personal study only.

โœฆ Synopsis


There are two steps to set-up a multicast connection in all optical wavelength division multiplexing (WDM) networks: routing and wavelength assignment. Multicast routing is to ยฎnd a tree in the network rooted from a source node and connecting all destination nodes. Wavelength assignment is to assign a wavelength to the generated routing tree in such a way that if two trees share a common link, then they must be assigned with two different wavelengths. This paper proposes two integrated algorithms to integrate routing and wavelength assignment. The proposed algorithms have the following advantages: (1) the number of wavelengths used is small; (2) the network cost of routing trees is low; and (3) the transmission delay from the source to any multicast destination is bounded.


๐Ÿ“œ SIMILAR VOLUMES


Efficient heuristic algorithms for light
โœ G Shen; S.K Bose; T.H Cheng; C Lu; T.Y Chai ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 147 KB

This paper presents heuristic algorithms that may be used for light-path routing and wavelength assignment in optical WDM networks under dynamically varying trafยฎc conditions. We consider both the situations where the wavelength continuity constraint is enforced or not enforced along a light-path. T