On the Complexity of the Traffic Grooming Problem in Optical Networks

A central problem in optical networks is to assign wavelengths to a given set of lightpaths, so that at most g of them that share a physical link get the same wavelength (g is the grooming factor). The switching cost for each wavelength is the number of distinct endpoints of lightpaths of that wavelength, and the goal is to minimize the total switching cost. We prove NP-completeness results for the problem of minimizing the switching costs in path networks. First we prove that the problem is NP-complete in the strong sense, when all demands are either 0 or 1, the routing is single-hop, and the number of wavelengths is unbounded. Next we prove that the problem is NP-complete for any fixed g ≥ 2, and when the number of wavelengths is bounded. These results improve upon existing results regarding the complexity of the traffic grooming problem for ring and path networks.

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

[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]  A.L. Chiu,et al.  Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.

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

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

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[8]  Shu Huang.  Traffic Grooming in Wavelength Routed Path Networks , 2003 .

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

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

[11]  George N. Rouskas,et al.  Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms , 2006, IEEE J. Sel. Areas Commun..

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

[13]  Shmuel Zaks,et al.  Approximating the Traffic Grooming Problem , 2005, ISAAC.

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

[15]  Dorit S. Hochbaum,et al.  The SONET edge-partition problem , 2003, Networks.

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

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