Dynamic Traffic Grooming in WDM Optical Networks with Full Wavelength Conversion and Grooming Devices on Max-Connectivity Nodes

Traffic grooming is applied to WDM optical networks with the intent of provisioning lower rate connection requests onto lightpaths with higher rate. Traffic grooming problem is an optimization problem which mainly focuses on minimization of network cost through minimizing the devices used in the network. Our work focuses on dynamic traffic grooming with full wavelength conversion. In this paper, we propose a heuristic approach to solve dynamic GRWA problem in WDM optical mesh networks with grooming devices only on Max-connectivity nodes. We provide first fit wavelength assignment procedure. We have compared our results with other grooming schemes and succeeded in showing that Max-connectivity grooming is more cost effective with similar blocking probability than other grooming schemes.