Abstract
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and wavelength assignment of the traffic streams. In this paper we consider the version where a traffic stream may be divided into several parts and assigned different wavelengths. A specific division may increase or decrease the number of ADMs needed for a given input. Following previous work, we consider two versions. In the arc version, the route of each traffic stream is given as input, and we need to decide on divisions of streams, and then to assign wavelengths so as to minimize the total number of used SONET ADMs. In the chord version, the route is not prespecified, but is assigned by the algorithm, and only after this step the divisions are done and wavelengths are assigned. The previously best known approximation algorithm for the arc version has a performance guarantee of \(\frac{5}{4} = 1.25\) whereas the previously best known approximation algorithm for the chord version has a performance guarantee of \(\frac{3}{2} = 1.5\). We improve both these results. We present a \(\frac{36}{29} \approx 1.24138\)-approximation algorithm for the arc version and a \(\frac{7}{5} = 1.4\)-approximation algorithm for the chord version.
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
Călinescu, G., Wan, P.-J.: Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs. Theoretical Computer Science 276(1–2), 33–50 (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.: The chord version for SONET ADMs minimization. Theoretical Computer Science (to appear)
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)
Gerstel, O., Lin, P., Sasaki, G.: Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings. In: INFOCOM 1998, vol. 1, pp. 94–101 (1998)
Liu, L., Li, X.-Y., Wan, P.-J., Frieder, O.: Wavelength assignment in WDM rings to minimize SONET ADMs. In: INFOCOM 2000, vol. 2, pp. 1020–1025 (2000)
Shalom, M., Zaks, S.: A 10/7 + ε approximation for minimizing the number of adms in sonet rings. In: Proc. of the First International Conference on Broadband Networks (BROADNETS 2004), pp. 254–262 (2004)
Wan, P.-J., Călinescu, G., Liu, L., Frieder, O.: Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE Journal on Selected Areas in Communications 18, 1995–2003 (2000)
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
Epstein, L., Levin, A. (2006). SONET ADMs Minimization with Divisible Paths. In: Erlebach, T., Persinao, G. (eds) Approximation and Online Algorithms. WAOA 2005. Lecture Notes in Computer Science, vol 3879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11671411_10
Download citation
DOI: https://doi.org/10.1007/11671411_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32207-8
Online ISBN: 978-3-540-32208-5
eBook Packages: Computer ScienceComputer Science (R0)