doi: 10.18178/ijfcc.2015.4.5.405
Constructing Resource Constrained Multicast Trees on WDM Networks with Limited Light-Splitting
- 1 Department of Computer Science and Information Engineering, National University of Tainan, Tainan, Taiwan
- 2 Department of Electrical and Computer Engineering, National Chiao Tung University, Hsinchu, Taiwan
- 3 Department of Electrical Engineering, National University of Tainan, Tainan, Taiwan
Abstract
Traditionally, the optimization goal of multicastrouting in WDM optical networks is to minimize the number ofwavelengths and fibers used for the multicasting. In this paper,we consider a problem concerned about how to multicastseveral video streams simultaneously to a number of clients in agiven WDM network with sparse light spitting, where thenumber of wavelengths on each link is given in advance. Ourgoal is to construct a number of multicast trees for all requiredstreams so that the multiple constraints: bandwidth, delay andmulticast capability, are satisfied and the total number of clientsparticipating in all multicast sessions is also maximized. Thisproblem is referred as profit-oriented and delay-constrainedgroup multicast routing (PDGRM) problem. Two heuristicalgorithms are proposed in this paper for this NP-hard problem.A set of experimental results are also provided to compare theperformances of our heuristics with previous methodspublished in literature.
Keywords
- Group multicasting
- light splitting
- profitmaximization
- WDM networks
How to Cite
Wen-Lin Yang, Chun-Tao Yang, and David Huang, "Constructing Resource Constrained Multicast Trees on WDM Networks with Limited Light-Splitting," International Journal of Future Computer and Communication, vol. 4, no. 5, pp. 299-304, 2015. https://doi.org/ 10.18178/ijfcc.2015.4.5.405
Copyright & License
Copyright © 2015 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).




