Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks?
ICCCN '09 Proceedings of the 2009 Proceedings of 18th International Conference on Computer Communications and Networks
Light trees: optical multicasting for improved performance in wavelength routed networks
IEEE Communications Magazine
WDM optical communication networks: progress and challenges
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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 $KN 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 multicast 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-\lceil \frac{N}{K+1} \rceil$.