Approximation algorithms for restoration capacity planning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1643, Issue , 1999, Pages 101-115

  Phillips, Steven J ^a   Westbrook, Jeffery R ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPLICATION PROGRAMS; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; OPTIMIZATION; RESTORATION; TELECOMMUNICATION NETWORKS;

APPROXIMATION RATIOS; CAPACITY PLANNING; EMPIRICAL STUDIES; EXPERIMENTAL EVALUATION; LINEAR RELAXATIONS; MULTI-COMMODITY FLOW; RESTORATION ROUTE; TELECOMMUNICATIONS NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 0009507538     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48481-7_10     Document Type: Conference Paper

References (13)

1. 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.
2. 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.
3. S. Cwilich, M. Deng, D. Houck, and D. Lynch. An LP-based approach to restoration network design. In ITC16, International Teletraffic Congress, 1999.
4. 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.
5. K. Eswaran and R. Tarjan. Augmentation problems. SIAM Journal on Computing, 5(4):653–665, 1976.
6. A. Frank. Augmenting graphs to meet edge-connectivity requirements. SIAM J. DISC.MATH., 5(1):25–53, 1992.
7. 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.
8. 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.
9. 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.
10. 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.
11. J. Kleinberg. Approximation algorithms for disjoint paths problems. PhD Thesis, Department of EECS, MIT, 1996.
12. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, 1995.
13. P. Raghavan and C. Thompson. Randomized rounding. Combinatorica, 7:365–374, 1987.