Dynamic multicast traffic grooming in optical WDM mesh networks : lightpath versus light-tree
Cheng, Tee Hiang
Date of Issue2013
School of Electrical and Electronic Engineering
With the rising popularity of multicast applications, various algorithms using either lightpath or light-tree schemes have been proposed for dynamic multicast traffic grooming in meshed wavelength division multiplexing (WDM) networks. To the best of our knowledge, however, no systematic comparison has ever been made between the performance of the two schemes in minimizing network blocking probability. In this paper, we address the dynamic multicast traffic grooming problem in WDM networks and present comprehensive comparisons between these two schemes in different cases. Our main contributions are twofold: first, we compare the performance of the existing lightpath- and light-tree-based grooming algorithms and show that, in most cases, the lightpath-based methods outperform the light-tree-based ones. We discuss and explain such observations. Second, we propose a lightpath-based algorithm, called the LightPath Fragmentation (LPF) method, to further improve the network blocking performance. Numerous simulations show that the LPF method steadily outperforms the existing algorithms in different cases. Effects of the ratio of unicast traffic loads versus overall traffic loads and the average number of destinations of each multicast request are also studied.
DRNTU::Engineering::Electrical and electronic engineering::Optics, optoelectronics, photonics
Journal of optical communications and networking
© 2013 Optical Society of America. This paper was published in Journal of Optical Communications and Networking and is made available as an electronic reprint (preprint) with permission of OSA. The paper can be found at the following official DOI: [http://dx.doi.org/10.1364/JOCN.5.000870]. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law.