Effective Traffic Grooming Algorithms in SONET/WDM Ring Networks

Abstract

Much work has focused on traffic grooming in SONET/WDM ring networks. Previous work has considered many aspects of traffic grooming, including minimizing the number of ADMs, minimizing the number of wavelengths, considering different traffic models, using different network architectures, incorporating switching capability and so on. In this work, we study traffic grooming in unidirectional ring networks with no switching capability under both uniform traffic and non-uniform traffic models to reduce electronic multiplexing costs. Based on the clustering notion, we derive a general and tighter lower bound for the number of ADMs required in traffic grooming under the uniform all-to-all traffic model. This bound reduces to special cases obtained in previous work. We also derive general, tighter, and closed form lower bounds for the number of ADMs required under two non-uniform traffic models: the distance-dependent traffic model and the non-uniform symmetric traffic model. Cost-effective multi-phase algorithms that exploit traffic characteristics are then designed and studied to efficiently groom traffic streams under different traffic models. Our numerical and simulation results show that the proposed multi-phase algorithms outperform existing traffic grooming algorithms by using a fewer number of ADMs. Our algorithms in several cases also achieve the lower bounds derived.