Abstract
We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection uses a primary path to deliver packets from the source to the destination. To ensure continuous operation in the event of an edge failure, each connection uses a set of backup bridges, each bridge protecting a portion of the primary path. To meet the bandwidth requirement of the connection, a certain amount of bandwidth must be allocated on the edges of primary path, as well as on the backup edges. In this paper, we focus on minimizing the amount of required backup allocation by sharing backup bandwidth among different connections. We consider efficient sharing schemes that require only partial information about the current state of the network. In particular, the only information available for each edge is the total amount of primary allocation and the cost of allocating backup bandwidth on this edge. We consider the problem of finding a minimum cost backup allocation together with a set of bridges for a given primary path. We prove that this problem is \({\mathcal NP}\)-hard and present an approximation algorithm whose performance is within \({\mathcal O}({\rm log} n)\) of the optimum, where n is the number of edges in the primary path.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kodialam, M.S., Lakshman, T.V.: Dynamic routing of bandwidth guaranteed tunnels with restoration. In: Proceedings of IEEE INFOCOM 2000, Tel-Aviv, Israel (2000)
Hwang, H., Ahn, S., Choi, Y., Kim, C.: Backup path sharing for survivable ATM networks. In: Proceedings of ICOIN-12 (1998)
Chekuri, C., Gupta, A., Kumar, A., Naor, J., Raz, D.: Building edge-failure resilient networks. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, p. 439. Springer, Heidelberg (2002)
Italiano, G., Rastogi, R., Yener, B.: Restoration algorithms for virtual private networks in the hose model. In: Proceedings of IEEE INFOCOM 2002, New York (2002)
Su, X., Su, C.F.: An online distributed protection algorithm in WDM networks. In: Proceedings of IEEE ICC 2001 (2001)
Sengupta, S., Ramamurthy, R.: Capacity efficient distributed routing of mesh-restored lightpaths in optical networks. In: Proceedings of IEEE GLOBECOM 2001 (2001)
Li, G., Wang, D., Kalmanek, C., Doverspike, R.: Efficient distributed path selection for shared restoration connections. In: Proceedings of IEEE INFOCOM 2002, New York (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bejerano, Y., Naor, J., Sprintson, A. (2005). Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_62
Download citation
DOI: https://doi.org/10.1007/11561071_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29118-3
Online ISBN: 978-3-540-31951-1
eBook Packages: Computer ScienceComputer Science (R0)