Practical traffic grooming scheme for single-hub SONET/WDM rings

In SONET/WDM networks, one fiber supports multiple wavelengths and each wavelength supports several low rate tributary streams. Traffic grooming is then defined as properly using the SONET add/drop multiplexer (ADM) to electronically multiplex and demultiplex required tributary traffic patterns with minimal resource cost (wavelengths and ADMs). This paper studies the traffic grooming problem in single hub SONET/WDM networks and extends existing results. We analyze the real deployments, generalize their results, and study the practical special cases. We prove that BLSR/2 would never be more expensive than UPSR under any traffic pattern. We present the exact minimum costs of uniform traffic in both UPSR and BLSR/2. We also give approximation algorithms for optimal grooming of non-uniform traffic after showing that this problem is NP-complete. Finally, we consider how to select the line speeds if there are two different line speeds available.

[1]  Ori Gerstel,et al.  Cost effective traffic grooming in WDM 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.

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

[3]  Biswanath Mukherjee,et al.  Optical Communication Networks , 1997 .

[4]  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.

[5]  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).

[6]  Charles J. Colbourn,et al.  Minimizing drop cost for SONET/WDM networks with ⅛ wavelength requirements , 2001 .

[7]  Xiang-Yang Li,et al.  Wavelength assignment in WDM rings to minimize SONET ADMs , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[9]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[10]  Xiang-Yang Li,et al.  Practical traffic grooming scheme for single-hub SONET/WDM rings , 2000, WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420).