Computer Science – Networking and Internet Architecture
Scientific paper
2010-11-30
Photonic Network Communication 20, 1 (2010) 33-42
Computer Science
Networking and Internet Architecture
Scientific paper
10.1007/s11107-010-0243-5
In sparse light splitting all-optical WDM networks, the more destinations a light-tree can accommodate, the fewer light-trees andwavelengths amulticast session will require. In this article, a Hypo-Steiner light-tree algorithm (HSLT) is proposed to construct a HSLT light-tree to include as many destinations as possible. The upper bound cost of the light-trees built by HSLT is given as N(N -1)/2, where N is the number of nodes in the network. The analytical model proves that, under the same condition, more destinations could be held in a HSLT than a Member-Only (Zhang et al., J. Lightware Technol, 18(12), 1917-1927 2000.) light-tree. Extensive simulations not only validate the proof but also show that the proposed heuristic outperforms the existing multicast routing algorithms by a large margin in terms of link stress, throughput, and efficiency ofwavelength usage.
Cousin Bernard
Molnar Miklos
Zhou Fen
No associations
LandOfFree
Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-574161