Abstract
We are motivated by the developments in all-optical networks - a new tech- nology that supports high bandwidth demands. These networks provide a set of ligthpaths which can be seen as high-bandwidth pipes on which communication is performed. Since the capacity enabled by this technology substatially exceeds the one provided by conventional networks, its ability to recover from failures within the optical layer is important. In this paper we study the design of a survivable optical layer. We assume that an initial set of pathlights (designed according to the expected communication pattern) is given, and we are targerted at augmenting this initial set with additional lightpaths such that the result will guarantee survivability. For this purposes, we define and motivate a ring parti- tion survivability condition that the solution must satisfy. Generally speaking, this condition states that lightpaths must be arranged in rings. The cost of the switching cost of the entire network. We present some negative results regarding the tractability and approximability of this problem, and an approximation al- gorithm for it. We analyze the performance of the algorithm for the general case (arbitrary topology) as well as for some special cases.
This is a preview of subscription content, log in via an institution to check access.
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
M. Alanyali and E. Ayanoglu. Provisioning algorithms for WDM optical net-works. In Proc. IEEE INFOCOM ’98, pages 910–918, 1998.
J. Armitage, O. Crochat, and J. Y. LeBoudec. Design of survivable WDM photonic network. In Proc. IEEE INFOCOM ’97, pages 244–252, 1997.
G. Chartrand and H. V. Kronk. Randomly traceable graphs. SIAM J. Appl. Math., 16:696–700, 1968.
T. Eilam, S. Moran, and S. Zaks. Approximation algorithms for survivable optical networks. Technical Report 2000-05, Department of Computer Sci-ence, Technion, Haifa, Israel, April 2000.
S. Even. Graph Algorithms. Computer Science Press, Woodland Hills, CA, 1979.
O. Gerstel, P. Lin, and G. Sasaki. Wavelength assignment in WDM ring to minimize cost of embedded SONET rings. In Proc. IEEE INFOCOM ’98, pages 94–101, 1998.
O. Gerstel, R. Ramaswami, and G.H. Sasaki. Fault tolerant multiwavelength optical rings with limited wavelength conversion. In Proc. IEEE INFOCOM ’97, pages 507–515, 1997.
Y. Hamazumi, N. Nagatsu, and K. Sato. Number of wavelengths required for optical networks with failure restoration. In Optical Fiber Communication, pages 67–68, Febuary 1994.
S. Micali and V.V. Vazirani. An O(y/V ? E) algorithm for finding maximum matching in general graphs. In Proc. 21st Ann. Symp. Foundations of Com-puter Science, pages 17–27, 1980.
R. Ramaswami and A. Segall. Distributed network control for optical net-works. IEEE/ACM Transactions on Networking, 5(6):936–943, 1997.
Rajiv Ramaswami and Kumar N. Sivarajan. Optical Networks: A Practical Perspective. Academic Press/ Morgan Kaufmann, 1998.
J. vanLeeuwen, ed. Handbook of Theoretical Computer Science, vol-ume A, chapter 10. The MIT Press, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eilam, T., Moran, S., Zaks, S. (2000). Approximation Algorithms for Survivable Optical Networks. In: Herlihy, M. (eds) Distributed Computing. DISC 2000. Lecture Notes in Computer Science, vol 1914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40026-5_7
Download citation
DOI: https://doi.org/10.1007/3-540-40026-5_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41143-7
Online ISBN: 978-3-540-40026-4
eBook Packages: Springer Book Archive