A heuristic approach based on dynamic multicast traffic grooming in WDM mesh networks

Abstract

The dynamic multicast traffic grooming is an efficient way to minimize the utilization of network resources such as wavelengths, transmitters, receivers and splitters and minimizing the traffic blocking probability. In this article, we initially formulate an Integer Linear Programming for minimizing the blocking probability associated with the network resources, then propose a heuristic algorithm for dynamic multicast traffic grooming problem to achieve our objective. We divide our problem into three sub-problems: (1) routing/provisioning of multicast requests; (2) light-tree based logical topology design, and (3) traffic grooming problem. In this approach, we will decide the appropriate grooming technique based on the ratio of number of wavelengths used in the networks to the number of transceivers and splitters. We use computer simulations to evaluate the performance of various policies used in this algorithm. Our simulation results demonstrate that our approach significantly reduces the blocking probability constraint by the network resources used in the network when compared with the other existing algorithms.