A 10/7 + $ \epsilon$ Approximation for Minimizing the Number of ADMs in SONET Rings

SONET add/drop multiplexers (ADMs) are dominant cost factors in WDM SONET rings. Whereas most previous papers on the topic concentrated on the number of wavelengths assigned to a given set of lightpaths, more recent papers argue that the number of ADMs is a more realistic cost measure. Some of these works discuss various heuristic algorithms for this problem, and the best known result is a 3/2 approximation in Calinescu and Wan, 2002. Through the study of the relation between this problem and the problem of finding maximum disjoint rings in a given set of lightpaths we manage to shed more light onto this problem and to develop a 10/7 + epsi approximation for it.

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

[2]  Sanjeev Khanna,et al.  A polynomial time approximation scheme for the SONET ring loading problem , 1997, Bell Labs Technical Journal.

[3]  Leah Epstein,et al.  Better Bounds for Minimizing SONET ADMs , 2004, WAOA.

[4]  Peter Winkler,et al.  Ring routing and wavelength translation , 1998, SODA '98.

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

[6]  Alexander Schrijver,et al.  On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems , 1989, SIAM J. Discret. Math..

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

[8]  Shmuel Zaks,et al.  Lightpath arrangement in survivable rings to minimize the switching cost , 2002, IEEE J. Sel. Areas Commun..

[9]  Peng-Jun Wan,et al.  Traffic partition in WDM/SONET rings to minimize SONET ADMs , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[10]  Peng-Jun Wan,et al.  Grooming of arbitrary traffic in SONET/WDM rings , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[11]  Gianpiero Monaco,et al.  Approximating the traffic grooming problem in tree and star networks , 2008, J. Parallel Distributed Comput..

[12]  David Coudert,et al.  Traffic grooming in unidirectional WDM ring networks using design theory , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[13]  Peng-Jun Wan,et al.  Minimizing electronic line terminals for automatic ring protection in general WDM optical networks , 2002, IEEE J. Sel. Areas Commun..

[14]  M. Shalom,et al.  Minimizing the Number of ADMsWith and Without Traffic Grooming: Complexity and Approximability , 2006, 2006 International Conference on Transparent Optical Networks.

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

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

[17]  Jean-Claude Bermond,et al.  Traffic grooming on the path , 2007, Theor. Comput. Sci..

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

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

[20]  Shmuel Zaks,et al.  Approximating the traffic grooming problem , 2008, J. Discrete Algorithms.