Algorithm for Dynamic Multicast Traffic Grooming in Optical Mesh Networks
Limin Peng
Abstract
Limin Peng
Abstract
Aiming at the problem of the huge bandwidth gap between low capacity requirement of an individual multicast connection and high capacity offered by a wavelength channel in current optical networks, a multicast traffic grooming algorithm based on the multicast traffic grooming model is proposed by grooming new multicast traffic onto the optical multicast trees which have been built, in order to improve network resource utilization efficiency and reduce multicast traffic blocking probability.Simulation results show that the network performance can be improved significantly by the algorithm.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Aiming at the problem of the huge bandwidth gap between low capacity requirement of an individual multicast connection and high capacity offered by a wavelength channel in current optical networks, a multicast traffic grooming algorithm based on the multicast traffic grooming model is proposed by grooming new multicast traffic onto the optical multicast trees which have been built, in order to improve network resource utilization efficiency and reduce multicast traffic blocking probability.Simulation results show that the network performance can be improved significantly by the algorithm.
Key concepts: Multicast, Computer science, Traffic grooming, Computer network, Xcast, Source-specific multicast, Protocol Independent Multicast, Distance Vector Multicast Routing Protocol