All Optical Multicast Routing in Sparse-Splitting Optical Networks
Journal
Proceedings - Conference on Local Computer Networks, LCN
Journal Volume
2003-January
Pages
162-167
Date Issued
2003-10
Author(s)
Cheng-Yu Hsieh
Abstract
This paper studies all-optical multicast routing in wavelength-routed optical networks with sparse light splitting. In a sparse splitting network, only a small percentage of nodes are capable of light splitting, i.e., multicast capable. The typical solutions of existing multicast routing algorithms for sparse splitting networks combine an existing Steiner tree heuristic with some rerouting procedures to refine the trees. The resulting tree cost in terms of the total number of wavelengths used on all tree links is then very expensive. In this paper, we propose a new mechanism that constructs all-optical multicast trees for sparse splitting networks without an additional rerouting procedure in the tree construction. Two efficient approaches are suggested and evaluated by simulations. The results show that our mechanism builds light-trees with the least wavelength channel cost and with the smallest number of wavelengths used per link. © 2003 IEEE.
Subjects
All-optical networks; Costs; Intelligent networks; Multicast algorithms; Multicast protocols; Optical fiber networks; Optical receivers; Optical transmitters; Wavelength division multiplexing; Wavelength routing
Other Subjects
Computer networks; Costs; Heuristic algorithms; Intelligent networks; Multicasting; Optical communication; Optical fibers; Optical receivers; Optical transmitters; Routing algorithms; Wavelength division multiplexing; All- optical networks; Multicast algorithms; Multicast protocol; Optical fiber networks; Wavelength routing; Network routing
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
01243123.pdf
Size
335.06 KB
Format
Adobe PDF
Checksum
(MD5):e90d5f4697e4d98fbc6a9215b47b8215