Dynamic multicast traffic grooming in WDM networks

Abstract

Dynamic multicast traffic grooming in wavelength division multiplexing (WDM) networks was analyzed to minimize networkwide costs and to increase the network resource utilization. A network model was developed for dynamic multicast traffic grooming with resource constraints and an algorithm that can provide quality of service (QoS) was proposed. The QoS is measured by the maximum number of lightpaths passing between the source and the destinations. The blocking probability of the algorithm was assessed in simulations. The results show that a higher QoS requirement results in higher blocking probability, and when the QoS requirement is low, changes in the QoS requirements have only small effects on the blocking probability.