Abstract
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpaths are given in advance. In a real-life situation, the requests (lightpaths) arrive at the network on-line, and we have to assign them wavelengths so as to minimize the switching cost. This study is thus of great importance in the theory of optical networks. We present an on-line algorithm for the problem, and show its competitive ratio to be \(\frac{7}{4}\). We show that this result is best possible in general. Moreover, we show that even for the ring topology network there is no on-line algorithm with competitive ratio better than \(\frac{7}{4}\). We show that on path topology the competitive ratio of the algorithm is \(\frac{3}{2}\). This is optimal for this topology. The lower bound on ring topology does not hold when the ring is of bounded size. We analyze the triangle topology and show a tight bound of \(\frac{5}{3}\) for it. The analyzes of the upper bounds, as well as those for the lower bounds, are all using a variety of proof techniques, which are of interest by their own, and which might prove helpful in future research on the topic.
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
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
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)
Epstein, L., Levin, A.: Better bounds for minimizing sonet adms. In: 2nd Workshop on Approximation and Online Algorithms (September 2004)
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)
Flammini, M., Shalom, M., Zaks, S.: On minimizing the number of adms - tight bounds for an algorithm without preprocessing. In: Erlebach, T. (ed.) CAAN 2006. LNCS, vol. 4235, Springer, Heidelberg (2006)
Flammini, M., Shalom, M., Zaks, S.: On minimizing the number of adms in a general topology optical network. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 459–473. Springer, Heidelberg (2006)
Gerstel, O., Lin, P., Sasaki, G.: Wavelength assignment in a wdm ring to minimize cost of embedded sonet rings. In: INFOCOM 1998. 17th Annual Conference of the IEEE Computer and Communications Societies, pp. 69–77. IEEE Computer Society Press, Los Alamitos (1998)
Gerstel, O., Ramaswami, R., Sasaki, G.: Cost effective traffic grooming in wdm rings. In: INFOCOM 1998. 7th Annual Conference of the IEEE Computer and Communications Societies, IEEE Computer Society Press, Los Alamitos (1998)
Leonardi, S., Vitaletti, A.: Randomized lower bounds for online path coloring. In: 2nd International Workshop on Randomization and Approximation Techniques in Computer Science, pp. 232–247 (1998)
Shalom, M., Wong, P.W., Zaks, S.: Optimal on-line colorings for minimizing the number of adms in optical networks. In: Technion, Faculty of Computer Science, Technical Report CS-2007-14 (July 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, pp. 254–262 (October 2004)
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
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shalom, M., Wong, P.W.H., Zaks, S. (2007). Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks. In: Pelc, A. (eds) Distributed Computing. DISC 2007. Lecture Notes in Computer Science, vol 4731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75142-7_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-75142-7_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75141-0
Online ISBN: 978-3-540-75142-7
eBook Packages: Computer ScienceComputer Science (R0)