Abstract
Amajor task of telecommunication network planners is deciding where spare capacity is needed, and howmuch, so that interrupted traffic may be rerouted in the event of a failure. Planning the spare capacity so as to minimize cost is an NP-hard problem, and for large networks, even the linear relaxation is too large to be solved with existing methods. The main contribution of this paper is a fast algorithm for restoration capacity planning with a proven performance ratio of at most 2+∈, and which generates solutions that are at most 1% away from optimal in empirical studies on a range of networks, with up to a few hundred nodes.
As a preliminary step, we present the first (1 + ∈)-approximation algorithm for restoration capacity planning. The algorithm could be practical for moderate-size networks. It requires the solution of a multicommodity-flow type linear program with O(m|G|) commodities, however, where G is the set of distinct traffic routes, and therefore O(m2jGj) variables. For many networks of practical interest, this results in programs too large to be handled with current linear programming technology. Our second result, therefore, has greater practical relevance: a (2+∈)- approximation algorithm that requires only the solution of a linear program with O(m) commodities, and hence O(m 2) variables. The linear program has been of manageable size for all practical telecommunications network instances that have arisen in the authors’ applications, and we present an implementation of the algorithm and an experimental evaluation showing that it is within 1% of optimal on a range of networks arising practice.
We also consider a more general problem in which both service and restoration routes are computed together. Both approximation algorithms extend to this case, with approximation ratios of 1 + ∈ and 4 + ∈, respectively.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Alevras, M. Grötschel, and R. Wessäly. Capacity and survivability models for telecommunication networks. Technical Report ZIB Preprint SC 97-24, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 1997. http://www.zib.de/pub/zib-publications/reports/SC-97-24.ps.
G. Brightwell, G. Oriolo, and F. B. Shepherd. Some strategies for reserving resilient capacity. Technical Report LSE-CDAM-98-04, London School of Economics Centre for Discrete and Applicable Mathematics, 1998. http://www.cdam.lse.ac.uk/Reports/Files/cdam-98-04.ps.gz.
S. Cwilich, M. Deng, D. Houck, and D. Lynch. An LP-based approach to restoration network design. In ITC16, International Teletraffic Congress, 1999.
S. Cwilich, M. Deng, D. Lynch, S. Phillips, and J. Westbrook. Algorithms for restoration planning in a telecommunications network. In Proc.ACMWorkshop on Experimental Analysis of Algorithms (ALENEX 99). Springer-Verlag, 1999.
K. Eswaran and R. Tarjan. Augmentation problems. SIAM Journal on Computing, 5(4):653–665, 1976.
A. Frank. Augmenting graphs to meet edge-connectivity requirements. SIAM J. DISC.MATH., 5(1):25–53, 1992.
M. Grötschel, C. L. Monma, and M. Stoer. Design of survivable networks. In Handbooks in Operations Research and Management Science, Network Models, chapter 10, pages 617–672. North-Holland, 1995.
M. Herzberg, S. J. Bye, and A. Utano. The hop-limit approach for spare-capacity assignment in survivable networks. IEEE/ACM Trans. on Networking, 3(6):775–783, 1995.
R. R. Iraschko, M. H. MacGregor, and W. D. Grover. Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks. IEEE/ACM Trans. on Networking, 6(3):325–336, 1998.
K. Jain. A factor 2 approximation algorithm for the generalized network steiner problem. In Proc. 39th IEEE Symp. on Foundation of Computer Science, pages 448–457, 1998.
J. Kleinberg. Approximation algorithms for disjoint paths problems. PhD Thesis, Department of EECS, MIT, 1996.
R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, 1995.
P. Raghavan and C. Thompson. Randomized rounding. Combinatorica, 7:365–374, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Phillips, S.J., Westbrook, J.R. (1999). Approximation Algorithms for Restoration Capacity Planning. In: Nešetřil, J. (eds) Algorithms - ESA’ 99. ESA 1999. Lecture Notes in Computer Science, vol 1643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_10
Download citation
DOI: https://doi.org/10.1007/3-540-48481-7_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66251-8
Online ISBN: 978-3-540-48481-3
eBook Packages: Springer Book Archive