All Optical Multicast Routing in Sparse-Splitting Optical Networks

Authors:
Cheng-Yu Hsieh;Wanjiun Liao
Affiliations:
-;-
Venue:
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
Year:
2003

Citing 0
Cited 4

A foresighted strategy for greed-based multicasting algorithms in all-optical mesh networks

Photonic Network Communications
Minimum cost multicast routing based on high utilization MC nodes suited to sparse-splitting optical networks

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Traffic groomed multicasting in sparse-splitting WDM backbone networks

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Optical multicast over wavelength-routed WDM networks: A survey

Optical Switching and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies all-optical multicast routing inwavelength-routed optical networks with sparse lightsplitting. In a sparse splitting network, only a smallpercentage of nodes are capable of light splitting, i.e.,multicast capable. The typical solutions of existingmulticast routing algorithms for sparse splitting networkscombine an existing Steiner Tree heuristic with somererouting procedures to refine the trees. The resulting treecost in terms of the total number of wavelengths used on alltree links is then very expensive. In this paper, we proposea new mechanism that constructs all-optical multicasttrees for sparse splitting networks without an additionalrerouting procedure in the tree construction. Two efficientapproaches are suggested and evaluated by simulations.The results show that our mechanism builds light-treeswith the least wavelength channel cost and with thesmallest number of wavelengths used per link.