Approximating the Traffic Grooming Problem

The problem of grooming is central in studies of optical networks. In graph-theoretic terms, this can be viewed as assigning colors to the lightpaths so that at most g of them (g being the grooming factor) can share one edge. The cost of a coloring is the number of optical switches (ADMs); each lightpath uses two ADM's, one at each endpoint, and in case g lightpaths of the same wavelength enter through the same edge to one node, they can all use the same ADM (thus saving g – 1 ADMs). The goal is to minimize the total number of ADMs. This problem was shown to be NP-complete for g = 1 and for a general g. Exact solutions are known for some specific cases, and approximation algorithms for certain topologies exist for g = 1. We present an approximation algorithm for this problem. For every value of g the running time of the algorithm is polynomial in the input size, and its approximation ratio for a wide variety of network topologies – including the ring topology – is shown to be 2 ln g + o(ln g). This is the first approximation algorithm for the grooming problem with a general grooming factor g.

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

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

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

[4]  Peng-Jun Wan,et al.  Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs , 2002, J. Comb. Optim..

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

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

[7]  David Coudert,et al.  Traffic grooming on the path , 2005, Theor. Comput. Sci..

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

[9]  Shmuel Zaks,et al.  On the Complexity of the Traffic Grooming Problem in Optical Networks , 2007, FUN.

[10]  Shmuel Zaks,et al.  A 10/7 + /spl epsi/ approximation for minimizing the number of ADMs in SONET rings , 2004, First International Conference on Broadband Networks.

[11]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

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

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

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