%0 Conference Proceedings
%T Cost Bounds of Multicast Light-trees in WDM Networks
%+ Advanced Technolgy in Networking (ATNET)
%+ Université de Rennes (UR)
%+ University at Buffalo [SUNY] (SUNY Buffalo)
%A Zhou, Fen
%A Molnar, Miklos
%A Cousin, Bernard
%A Qiao, Chunming
%< avec comité de lecture
%( Lecture Notes in Computer Science,
%B IFIP Networking conference
%C Chennai, India
%Y Mark Crovella; Laura Marie Feeney; Dan Rubenstein; S. V. Raghavan
%I Springer
%3 Lecture Notes in Computer Science, proceedings of IFIP Networking conference
%V 6091
%P 339-350
%8 2010-05-10
%D 2010
%R 10.1007/978-3-642-12963-6_27
%K WDM Networks
%K All-Optical Multicast Routing (AOMR)
%K Light-trees
%K Sparse Splitting
%K Cost Bounds
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting constraint and the absence of wavelength converters, several light-trees may be required to establish a multicast session. However, the computation of optimal multicast light-trees is NP-hard. In this paper, we study the wavelength channel cost (i.e., total cost) of the light-trees built for a multicast session. An equal cost of 1 unit hop-count cost is assumed over all the fiber links in the network. We prove that the total cost of a multicast session is tightly lower limited to K and upper bounded to (1) K(N −K) when K < N/2 ; (2) (N^2 −1)/4 or (N^2)/4 respectively when K ≥ N/2 and N is odd or even, where K is the number of destinations in the multicast session and N is the number of nodes in the network. Classical sparse splitting multi- cast routing algorithms such as Reroute-to-Source and Member-Only [3] also follow these bounds. And particularly in WDM rings, the optimal multicast light-tree has a cost inferior to N − ⌈ N/( K+1) ⌉.
%G English
%2 https://inria.hal.science/hal-00541058v2/document
%2 https://inria.hal.science/hal-00541058v2/file/main.pdf
%L hal-00541058
%U https://inria.hal.science/hal-00541058
%~ INSTITUT-TELECOM
%~ EC-PARIS
%~ UNIV-RENNES1
%~ CNRS
%~ INRIA
%~ UNIV-UBS
%~ INSA-RENNES
%~ IRISA
%~ IRISA_SET
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-LNCS-6091
%~ IRISA-INSA-R
%~ IRISA-D2
%~ UR1-HAL
%~ UR1-MATH-STIC
%~ UR1-UFR-ISTIC
%~ IFIP-2010
%~ TEST-UNIV-RENNES
%~ TEST-UR-CSS
%~ UNIV-RENNES
%~ INRIA-AUT
%~ INSTITUTS-TELECOM
%~ UR1-MATH-NUM