Effective traffic grooming in WDM rings

Much work has focused on traffic grooming in WDM ring networks. Previous work has considered many aspects of traffic grooming, including minimizing number of ADMs, minimizing number of wavelengths, single hub and multiple hub architectures, switching capabilities etc. In this work, we derive general and tighter bounds on the number of wavelengths in WDM ring networks that may be capable of switching streams across wavelengths. We also study traffic grooming in unswitched UPSR rings and derive a more general lower bound for the number of ADMs required in traffic grooming. This bound reduces to special cases first obtained in [1]. A cost-effective multi-phase traffic grooming algorithm is proposed and studied for UPSR rings. Our numerical results show that this algorithm outperforms existing traffic grooming algorithms, resulting in traffic grooming that uses lower number of ADMs. Our algorithm in many cases also reaches the general lower bound derived.