Abstract
We consider the problem of switching cost in optical networks, where messages are sent along lightpaths. Given lightpaths, we have to assign them colors, so that at most g lightpaths of the same color can share any edge (g is the grooming factor). The switching of the lightpaths is performed by electronic ADMs (Add-Drop-Multiplexers) at their endpoints and optical ADMs (OADMs) at their intermediate nodes. The saving in the switching components becomes possible when lightpaths of the same color can use the same switches. Whereas previous studies concentrated on the number of ADMs, we consider the cost function - incurred also by the number of OADMs - of f(α) = α|OADMs| + (1 − α)|ADMs|, where 0 ≤ α ≤ 1. We concentrate on chain networks, but our technique can be directly extended to ring networks. We show that finding a coloring which will minimize this cost function is NP-complete, even when the network is a chain and the grooming factor is g = 2, for any value of α. We then present a general technique that, given an r-approximation algorithm working on particular instances of our problem, i.e. instances in which all requests share a common edge of the chain, builds a new algorithm for general instances having approximation ratio r ⌈logn ⌉. This technique is used in order to obtain two polynomial time approximation algorithms for our problem: the first one minimizes the number of OADMs (the case of α= 1), and its approximation ratio is 2 ⌈logn ⌉; the second one minimizes the combined cost f(α) for 0 ≤ α< 1, and its approximation ratio is \(2 \sqrt{g}~\lceil \log n \rceil\).
This research was partly supported by the European Union under Project “Graphs and Algorithms in Communication Networks (GRAAL)” - COST Action TIST 293 and under IST FET Integrated Project AEOLUS (IST-015964).
Chapter PDF
References
Amini, O., Pérennes, S., Sau, I.: Hardness and approximation of traffic grooming. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 561–573. Springer, Heidelberg (2007)
Beauquier, B., Bermond, J.-C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph Problems Arising from wavelength-routing in all- optical networks. In: Proc. 2nd Workshop on Optics and Computer Science, WOCS 1997 (April 1997)
Bérmond, J.-C., Braud, L., Coudert, D.: Traffic grooming on the path. In: 12 th Colloqium on Structural Information and Communication Complexity, Le Mont Saint-Michel, France (May 2005)
Bermond, J.-C., Coudert, D.: Traffic grooming in unidirectional WDM ring networks using design theory. In: IEEE ICC, Anchorage, Alaska (May 2003)
Brackett, C.A.: Dense wavelength division multiplexing networks: principles and applications. IEEE Journal on Selected Areas in Communications 8, 948–964 (1990)
Chen, B., Rouskas, G.N., Dutta, R.: Traffic grooming in star networks. In: Broadnets (2004)
Chen, B., Rouskas, G.N., Dutta, R.: Traffic grooming in wdm ring networks with the min-max objective. In: NETWORKING, pp. 174–185 (2004)
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)
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)
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)
Dor, D., Tarsi, M.: Graph decomposition is np-complete: A complete proof of holyer’s conjecture. SIAM Journal on Computing 26(4), 1166–1187 (1997)
Du, D.H.C., Vetter, R.J.: Distributed computing with high-speed optical networks. In: Proceeding of IEEE Computer, vol. 26, pp. 8–18 (1993)
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)
Epstein, L., Levin, A.: Better bounds for minimizing sonet adms. In: 2nd Workshop on Approximation and Online Algorithms, Bergen, Norway (September 2004)
Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the traffic grooming problem in tree and star neetworks. Journal of Parallel and Distributed Computing (to appear, 2008)
Flammini, M., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the traffic grooming problem. In: Deng, X., Du, D. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 915–924. Springer, Heidelberg (2005)
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 (1998)
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)
Green, P.E.: Fiber-Optic Communication Networks. Prentice Hall, Englewood Cliffs (1992)
Klasing, R.: Methods and problems of wavelength-routing in all-optical networks. In: Proceeding of the MFCS 1998 Workshop on Communication, August 24-25, Brno, Czech Republic, pp. 1–9 (1998)
Shalom, M., Unger, W., Zaks, S.: On the complexity of the traffic grooming problem in optical networks. In: Fun with Algorithms, 4th International Conference, Castiglioncello, Italy, pp. 262–271 (June 2007)
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 (October 2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S. (2008). Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs . In: Luque, E., Margalef, T., Benítez, D. (eds) Euro-Par 2008 – Parallel Processing. Euro-Par 2008. Lecture Notes in Computer Science, vol 5168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85451-7_99
Download citation
DOI: https://doi.org/10.1007/978-3-540-85451-7_99
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85450-0
Online ISBN: 978-3-540-85451-7
eBook Packages: Computer ScienceComputer Science (R0)