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.
KeywordsWavelength Assignment Wavelength Division Multiplexing(WDM) Optical Networks Add-Drop Multiplexer(ADM)
Unable to display preview. Download preview PDF.
- Bermond, J.-C., Braud, L., Coudert, D.: Traffic grooming on the path. In: 12th Colloqium on Structural Information and Communication Complexity, Le Mont Saint-Michel, France (May 2005)Google Scholar
- Bermond, J.-C., Coudert, D.: Traffic grooming in unidirectional WDM ring networks using design theory. In: IEEE ICC, Anchorage, Alaska (May 2003)Google Scholar
- Dutta, R., Huang, S., Rouskas, G.N.: Traffic grooming in path, star and tree networks: Complexity, bounds, and algorithms. IEEE Journal on Selected Areas in Communications 24(4), 66–82 (2006)Google Scholar
- Epstein, L., Levin, A.: Better bounds for minimizing SONET ADMs. In: 2nd Workshop on Approximation and Online Algorithms, Bergen, Norway (September 2004)Google Scholar
- Gerstel, O., Lin, P., Sasaki, G.: Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings. In: INFOCOM’98, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 69–77. IEEE Computer Society Press, Los Alamitos (1998)Google Scholar
- Gerstel, O., Ramaswami, R., Sasaki, G.: Cost effective traffic grooming in WDM rings. In: INFOCOM’98, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE Computer Society Press, Los Alamitos (1998)Google Scholar
- Huang, S.: Traffic Grooming in Wavelength Routed Path Networks. PhD thesis, North Carolina State University (2002)Google Scholar
- Shalom, M., Zaks, S.: A 10/7 + ε approximation scheme for minimizing the number of ADMs in SONET rings. In: First Annual International Conference on Broadband Networks, San-José, California, USA, pp. 254–262 (October 2004)Google Scholar
- Zhu, K., Mukherjee, B.: A review of traffic grooming in WDM optical networks: Architecture and challenges. Optical Networks Magazine 4(2), 55–64 (2003)Google Scholar