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
CITATION STYLE
Zhou, F., Molnár, M., Cousin, B., & Qiao, C. (2010). Cost bounds of multicast light-trees in WDM networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6091 LNCS, pp. 339–350). https://doi.org/10.1007/978-3-642-12963-6_27
Mendeley helps you to discover research relevant for your work.