Traffic Grooming in Star Networks via Matching Techniques

  • Ignasi Sau
  • Mordechai Shalom
  • Shmuel Zaks
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6058)


The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the grooming factor) paths of the same color can share an edge. Each path uses an ADM at each of its endpoints, and paths of the same color can share an ADM in a common endpoint. There are two sub-models, depending on whether or not paths that have the same color can use more than two edges incident with the same node (bifurcation allowed and bifurcation not allowed, resp.). The goal is to find a coloring that minimizes the total number of ADMs. In a previous work it was shown that the problem is NP-complete when bifurcation is allowed, even for a star network. In this paper we study the problem for a star network when bifurcation is not allowed. For the case of simple requests - in which only the case of g = 2 is of interest - we present a polynomial-time algorithm, and we study the structure of optimal solutions. We also present results for the case of multiple requests and g = 2, though the exact complexity of this case remains open. We provide two techniques, which lead to \(\frac{4}{3}\)-approximation algorithms. Our algorithms reduce the problem of traffic grooming in star networks to several variants of maximum matching problems.


Traffic grooming optical networks approximation algorithms maximum matching Add-Drop Multiplexer 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Amini, O., Pérennes, S., Sau, I.: Hardness and Approximation of Traffic Grooming. Theoretical Computer Science 410(38-40), 3751–3760 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bermond, J.-C., Braud, L., Coudert, D.: Traffic grooming on the path. Theoretical Computer Science 384(2-3), 139–151 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Brackett, C.A.: Dense wavelength division multiplexing networks: principles and applications. IEEE Journal on Selected Areas in Communications 8, 948–964 (1990)CrossRefGoogle Scholar
  4. 4.
    Chow, T., Lin, P.: The ring grooming problem. Networks 44(3), 194–202 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Chung, N.K., Nosu, K., Winzer, G.: Special issue on dense wdm networks. IEEE Journal on Selected Areas in Communications 8 (1990)Google Scholar
  6. 6.
    Diestel, R.: Graph Theory, vol. 173. Springer, Heidelberg (2005)zbMATHGoogle Scholar
  7. 7.
    Dutta, R., Rouskas, N.: Traffic grooming in WDM networks: Past and future. IEEE Network 16(6), 46–56 (2002)CrossRefGoogle Scholar
  8. 8.
    Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the Traffic Grooming Problem in Tree and Star Networks. Journal of Parallel and Distributed Computing 68(7), 939–948 (2008)CrossRefGoogle Scholar
  9. 9.
    Flammini, M., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the Traffic Grooming Problem. Journal of Discrete Algorithms 6(3), 472–479 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Gargano, L., Vaccaro, U.: Routing in All–Optical Networks: Algorithmic and Graph-Theoretic Problems. In: Numbers, Information and Complexity. Kluwer Academic, Dordrecht (2000)Google Scholar
  11. 11.
    Huang, S., Dutta, R., Rouskas, G.: Traffic Grooming in Path, Star, and Tree Networks: Complexity, Bounds, and Algorithms. IEEE Journal on Selected Areas in Communications 24(4), 66–82 (2006)CrossRefGoogle Scholar
  12. 12.
    Li, Z., Sau, I.: Graph Partitioning and Traffic Groomingwith Bounded Degree Request Graph. In: Paul, C. (ed.) WG 2009. LNCS, vol. 5911, pp. 250–261. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  13. 13.
    Muñoz, X., Sau, I.: Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 300–311. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  14. 14.
    Pulleyblank, R.: Faces of Matching Polyhedra. PhD thesis, University of Waterloo (1973)Google Scholar
  15. 15.
    Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)zbMATHGoogle Scholar
  16. 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-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Ignasi Sau
    • 1
  • Mordechai Shalom
    • 2
  • Shmuel Zaks
    • 1
  1. 1.Department of Computer ScienceTechnionHaifaIsrael
  2. 2.TelHai Academic College, Upper GalileeIsrael

Personalised recommendations