Abstract
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, this can be viewed as assigning colors to the lightpaths so that at most g of them (g being the grooming factor) can share one edge. The cost of a coloring is the number of optical switches (ADMs); each lightpath uses two ADM’s, one at each endpoint, and in case g lightpaths of the same wavelength enter through the same edge to one node, they can all use the same ADM (thus saving g – 1 ADMs). The goal is to minimize the total number of ADMs. This problem was shown to be NP-complete for g = 1 and for a general g. Exact solutions are known for some specific cases, and approximation algorithms for certain topologies exist for g = 1. We present an approximation algorithm for this problem. For every value of g the running time of the algorithm is polynomial in the input size, and its approximation ratio for a wide variety of network topologies – including the ring topology – is shown to be 2 ln g + o(ln g). This is the first approximation algorithm for the grooming problem with a general grooming factor g.
This research was supported in part by the EU COST 293 (GRAAL) research fund.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Zhu, K., Mukherjee, B.: A review of traffic grooming in wdm optical networks: Architecture and challenges. Optical Networks Magazine 4(2), 55–64 (2003)
Gerstel, O., Lin, P., Sasaki, G.: Wavelength assignment in a wdm ring to minimize cost of embedded sonet rings. In: INFOCOM 1998, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 69–77 (1998)
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)
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)
Shalom, M., Zaks, S.: A 10/7 + ε approximation scheme for minimizing the number of adms in sonet rings. First Annual International Conference on Broadband Networks, San-José, California, USA (October 2004)
Epstein, L., Levin, A.: Better bounds for minimizing sonet adms. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol. 3351, pp. 281–294. Springer, Heidelberg (2005)
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)
Gerstel, O., Ramaswami, R., Sasaki, G.: Cost effective traffic grooming in wdm rings. In: INFOCOM 1998, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies (1998)
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)
Bermond, J.-C., Coudert, D.: Traffic grooming in unidirectional WDM ring networks using design theory. In: IEEE ICC, Anchorage, Alaska (May 2003)
Bérmond, 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)
Shalom, M., Unger, W., Zaks, S.: On the complexity of the traffic grooming problem (2005) (in preparation)
Chvátal, V.: A greedy heuristic for the set covering problem. Mathematics of Operation Research 4, 233–235 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flammini, M., Moscardelli, L., Shalom, M., Zaks, S. (2005). Approximating the Traffic Grooming Problem. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_91
Download citation
DOI: https://doi.org/10.1007/11602613_91
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)