Abstract
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.
This research was partially supported by the Israel Science Foundation, grant No. 1249/08 and British Council grant UKTELHAI09.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amini, O., Pérennes, S., Sau, I.: Hardness and Approximation of Traffic Grooming. Theoretical Computer Science 410(38-40), 3751–3760 (2009)
Bermond, J.-C., Braud, L., Coudert, D.: Traffic grooming on the path. Theoretical Computer Science 384(2-3), 139–151 (2007)
Brackett, C.A.: Dense wavelength division multiplexing networks: principles and applications. IEEE Journal on Selected Areas in Communications 8, 948–964 (1990)
Chow, T., Lin, P.: The ring grooming problem. Networks 44(3), 194–202 (2004)
Chung, N.K., Nosu, K., Winzer, G.: Special issue on dense wdm networks. IEEE Journal on Selected Areas in Communications 8 (1990)
Diestel, R.: Graph Theory, vol. 173. Springer, Heidelberg (2005)
Dutta, R., Rouskas, N.: Traffic grooming in WDM networks: Past and future. IEEE Network 16(6), 46–56 (2002)
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)
Flammini, M., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the Traffic Grooming Problem. Journal of Discrete Algorithms 6(3), 472–479 (2008)
Gargano, L., Vaccaro, U.: Routing in All–Optical Networks: Algorithmic and Graph-Theoretic Problems. In: Numbers, Information and Complexity. Kluwer Academic, Dordrecht (2000)
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)
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)
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)
Pulleyblank, R.: Faces of Matching Polyhedra. PhD thesis, University of Waterloo (1973)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)
Zhu, K., Mukherjee, B.: A review of traffic grooming in wdm optical networks: Architecture and challenges. Optical Networks Magazine 4(2), 55–64 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sau, I., Shalom, M., Zaks, S. (2010). Traffic Grooming in Star Networks via Matching Techniques. In: Patt-Shamir, B., Ekim, T. (eds) Structural Information and Communication Complexity. SIROCCO 2010. Lecture Notes in Computer Science, vol 6058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13284-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-13284-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13283-4
Online ISBN: 978-3-642-13284-1
eBook Packages: Computer ScienceComputer Science (R0)