A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
All Optical Multicast Routing in Sparse-Splitting Optical Networks
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
On multicast traffic grooming in WDM networks
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
Light trees: optical multicasting for improved performance in wavelength routed networks
IEEE Communications Magazine
Hi-index | 0.00 |
As the interest of the Internet multicasting increases, the huge portion of the future traffic in optical WDM networks is expected to be strongly related to multicast applications and thus the technology for grooming such traffics also becomes important. In this study, we investigate the problem of multicast traffic grooming in WDM optical mesh networks with sparse-splitting capability. The problem of constructing optimal multicast routing trees and grooming their traffics in WDM optical mesh networks is NP-hard. Therefore, we propose heuristic algorithms to solve the problem in an efficient manner. These reduce the link cost by constructing a minimal cost tree with multicast capable nodes and increase the traffic grooming effect based on the relationship of multicast sessions. Comprehensive simulation results demonstrate that the proposed schemes use the network resource more efficiently especially for link cost compared to the previous work [1] while maintaining the similar number of wavelengths.