Abstract
Minimizing the number of electronic switches in optical networks is a main research topic in recent studies. In such networks we assign colors to a given set of lightpaths. Thus the lightpaths are partitioned into cycles and paths, and the switching cost is minimized when the number of paths is minimized. The problem of minimizing the switching cost is NP-hard. A basic approximation algorithm for this problem eliminates cycles of size at most l, and has a performance guarantee of \(OPT+\frac{1}{2}(1+\epsilon)N\), where OPT is the cost of an optimal solution, N is the number of lightpaths, and \(0 \leq \epsilon \leq \frac{1}{l+2}\), for any given odd l. We improve the analysis of this algorithm and prove that \(\epsilon \leq \frac{1}{\frac{3}{2}(l+2)}\). This implies an improvement in the running time of the algorithm: for any ε, the exponent of the running time needed for the same approximation ratio is reduced by a factor of 3/2. We also show a lower bound of \(\epsilon \geq \frac{1}{2l+3}\). In addition, in our analysis we suggest a novel technique, including a new combinatorial lemma.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
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. In: 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)
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., 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)
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, pp. 72–85. Springer, Heidelberg (2006)
Flammini, M., Shalom, M., Zaks, S.: On minimizing the number of adms in a general topology optical network. Technion, Faculty of Computer Science, Technical Report CS-2006-14 (July 2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flammini, M., Shalom, M., Zaks, S. (2006). On Minimizing the Number of ADMs in a General Topology Optical Network. In: Dolev, S. (eds) Distributed Computing. DISC 2006. Lecture Notes in Computer Science, vol 4167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11864219_32
Download citation
DOI: https://doi.org/10.1007/11864219_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44624-8
Online ISBN: 978-3-540-44627-9
eBook Packages: Computer ScienceComputer Science (R0)