Unification and extension of the traffic-grooming problem in WDM ring networks

The traffic-grooming problem multiplexes smaller-rate traffic streams into higher-rate streams using the smallest number of SONET add-drop multiplexers (S-ADMs). By unifying and extending previous work, two new approaches-single-hop and multi-hop-are introduced and evaluated.

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

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

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