Advertisement

On the Complexity of the Traffic Grooming Problem in Optical Networks

(Extended Abstract)
  • Mordechai Shalom
  • Walter Unger
  • Shmuel Zaks
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4475)

Abstract

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.

Keywords

Wavelength Assignment Wavelength Division Multiplexing(WDM) Optical Networks Add-Drop Multiplexer(ADM) 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. Bermond, J.-C., Coudert, D.: Traffic grooming in unidirectional WDM ring networks using design theory. In: IEEE ICC, Anchorage, Alaska (May 2003)Google Scholar
  3. Călinescu, G., Frieder, O., Wan, P.-J.: Minimizing electronic line terminals for automatic ring protection in general WDM optical networks. IEEE Journal of Selected Area on Communications 20(1), 183–189 (2002)CrossRefGoogle Scholar
  4. Chiu, A.L., Modiano, E.H.: Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. Journal of Lightwave Technology 18(1), 2–12 (2000)CrossRefGoogle Scholar
  5. Călinescu, G., Wan, P.-J.: Traffic partition in WDM/SONET rings to minimize SONET ADMs. Journal of Combinatorial Optimization 6(4), 425–453 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 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
  7. Epstein, L., Levin, A.: Better bounds for minimizing SONET ADMs. In: 2nd Workshop on Approximation and Online Algorithms, Bergen, Norway (September 2004)Google Scholar
  8. Eilam, T., Moran, S., Zaks, S.: Lightpath arrangement in survivable rings to minimize the switching cost. IEEE Journal of Selected Area on Communications 20(1), 172–182 (2002)MathSciNetCrossRefGoogle Scholar
  9. Flammini, M., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the traffic grooming problem. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. Goldschmidt, O., Hochbaum, D.S., Levin, A., Olinick, E.V.: The sonet edge-partition problem. NETWORKS 41(1), 32–37 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  11. Garey, M., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York (1979)zbMATHGoogle Scholar
  12. 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
  13. 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
  14. Huang, S.: Traffic Grooming in Wavelength Routed Path Networks. PhD thesis, North Carolina State University (2002)Google Scholar
  15. 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
  16. 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

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Mordechai Shalom
    • 1
    • 3
  • Walter Unger
    • 2
  • Shmuel Zaks
    • 1
  1. 1.Department of Computer Science, Technion, HaifaIsrael
  2. 2.Lehrstuhl für Informatik I RWTH Aachen Ahornstraße 55 52056 AachenGermany
  3. 3.TelHai Academic College, Upper Galilee, 12210Israel

Personalised recommendations