Effective Traffic Grooming Algorithms in SONET/WDM Ring Networks

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.

[1]  Ori Gerstel,et al.  Cost-effective traffic grooming in WDM rings , 2000, TNET.

[2]  C. Siva Ram Murthy,et al.  WDM Optical Networks: Concepts, Design, and Algorithms , 2001 .

[3]  Xiang-Yang Li,et al.  Select line speeds for single-hub SONET/WDM ring networks , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[4]  Xiang-Yang Li,et al.  Practical traffic grooming scheme for single-hub SONET/WDM rings , 2000, Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000.

[5]  Arun K. Somani,et al.  Request-specific routing in WDM grooming networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[6]  Adel A. M. Saleh,et al.  Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic , 1999 .

[7]  George N. Rouskas,et al.  On optimal traffic grooming in WDM rings , 2002, IEEE J. Sel. Areas Commun..

[8]  A.L. Chiu,et al.  Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.

[9]  Eytan Modiano,et al.  Switching and Traffic Grooming in WDM Networks , 2002, JCIS.

[10]  Uyless D. Black Optical Networks: Third Generation Transport Systems , 2002 .

[11]  Chunming Qiao,et al.  An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings , 2000, TNET.

[12]  Arun K. Somani,et al.  Traffic grooming for survivable WDM mesh networks , 2001, OptiComm: Optical Networking and Communications Conference.

[13]  Ori Gerstel,et al.  Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[14]  Eytan Modiano,et al.  Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic , 2000, IEEE Journal on Selected Areas in Communications.

[15]  Arun K. Somani,et al.  Dynamic Routing in WDM Grooming Networks , 2004, Photonic Network Communications.

[16]  Adel A. M. Saleh,et al.  On the value of wavelength-add/drop in WDM rings with uniform traffic , 1998 .

[17]  Rahul Simha,et al.  An efficient algorithm for reducing the number of Add-Drop Multiplexers in SONET/WDM rings , 2002, J. High Speed Networks.

[18]  Jian Wang,et al.  Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multihop connections , 2001 .

[19]  Jian Wang,et al.  Improved Approaches for Cost-Effective Traffic Grooming in WDM Ring Networks: Uniform-Traffic Case* , 2001, Photonic Network Communications.

[20]  Jian-Qiang Hu,et al.  Optimal traffic grooming for wavelength-division-multiplexing rings with all-to-all uniform traffic , 2002 .

[21]  Peng-Jun Wan,et al.  Grooming of arbitrary traffic in SONET/WDM BLSRs , 2000, IEEE Journal on Selected Areas in Communications.

[22]  George N. Rouskas,et al.  Traffic grooming in WDM networks: past and future , 2002, IEEE Netw..

[23]  Ori Gerstel,et al.  Combined WDM and SONET network design , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[24]  Chunming Qiao,et al.  Effective and comprehensive solution to traffic grooming and wavelength assignment in SONET/WDM rings , 1998, Other Conferences.

[25]  Mauro Brunato,et al.  A Multistart Randomized Greedy Algorithm for Traffic Grooming on Mesh Logical Topologies , 2002, ONDM.

[26]  Biswanath Mukherjee,et al.  Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..

[27]  V. R. Konda,et al.  Algorithm for traffic grooming in optical networks to minimize the number of transceivers , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[28]  Stéphane Pérennes,et al.  Traffic grooming in WDM networks with multi-layer switches , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[29]  Biswanath Mukherjee,et al.  A Review of Traffic Grooming in WDM Optical Networks: Architectures and Challenges , 2002 .

[30]  Philip J. Lin,et al.  The ring grooming problem , 2004, Networks.

[31]  Eytan Modiano,et al.  The Role of Switching in Reducing Network Port Counts , 2001 .