Building edge-failure resilient networks

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

Volumn 2337 LNCS, Issue , 2002, Pages 439-456

  Chekuri, Chandra ^a   Gupta, Anupam ^a   Kumar, Amit ^b   Naor, Joseph ^c   Raz, Danny ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; TOPOLOGY;

BACKUP ALLOCATION; HIGH SPEED OPTICAL NETWORKS; NETWORK DESIGN PROBLEMS; PRIMARY NETWORKS; RESILIENT NETWORKS; SINGLE-LINK FAILURES; SOURCE-SINK PAIRS; UNDERLYING NETWORKS; BACKUP BANDWIDTH;

INTEGER PROGRAMMING;

EID: 23044531916     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47867-1_31     Document Type: Conference Paper

References (27)

1. A. Bremler-Barr, Y. Afek, E. Cohen, H. Kaplan and M. Merritt. Restoration by Path Concatenation: Fast Recovery of MPLS Paths. In Proceedings of the ACM PODC, pages 43-52, 2001.
2. A. Balakrishnan, T. Magnanti, and P. Mirchandani. Network Design. Annotated Bibliographies in Combinatorial Optimization, M. Dell'Amico, F. Maffioli, and S. Martello (eds.), John Wiley and Sons, New York, 311-334, 1997.
3. A. Balakrishnan, T. Magnanti, J. Sokol, and Y. Wang. Modeling and Solving the Single Facility Line Restoration Problem. Working Paper OR 327-98, Operations Research Center, MIT, 1998. To appear in Operations Research.
4. A. Balakrishnan, T. Magnanti, J. Sokol, and Y. Wang. Telecommunication Link Restoration Planning with Multiple Facility Types. To appear in Annals of Operations Research, volume "Topological Network Design in Telecommunications" edited by P. Kubat and J. M. Smith.
5. D. Bienstock and G. Muratore. Strong Inequalities for Capacitated Survivable Network Design Problems. Math. Programming, 89:127-147, 2001.
6. G. Brightwell, G. Oriolo and F. B. Shepherd. Reserving resilient capacity in a network. In SIAM J. Disc. Math., 14(4), 524-539, 2001.
7. G. Brightwell, G. Oriolo and F. B. Shepherd. Reserving Resilient Capacity with Upper Bound Constraints. Manuscript.
8. G. Dahl and M. Stoer. A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems. INFORMS Journal on Computing, 10, 1-11, 1998.
9. B. Davie and Y. Rekhter. MPLS: Technology and Applications. Morgan Kaufmann Publishers, 2000.
10. N. G. Duffield, P. Goyal, A. G. Greenberg, P. P. Mishra, K.K. Ramakrishnan, and J. E. van der Merwe. A flexible model for resource management in virtual private networks. In Proceedings of the ACM SIGCOMM, Computer Communication Review, volume 29, pages 95-108, 1999.
11. L. Fleischer, A. Meyerson, I. Saniee, F. B. Shepherd and A. Srinivasan. Nearoptimal design of MPλS tunnels with shared recovery. DIMACS Mini-Workshop on Quality of Service Issues in the Internet, 2001.
12. A. Fumagalli and L. Valcarenghi. IP restoration vs. WDM Protection: Is there an Optimal Choice? IEEE Network, 14(6):34-41, November/December 2000.
13. M. Goemans and J. Kleinberg. An improved approximation ratio for the minimum latency problem. In Proceedings of 7th ACM-SIAM SODA, pages 152-157, 1996.
14. N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group Steiner tree problem. Journal of Algorithms, 37(1):66-84, 2000.
15. (Preliminary version in: 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 253-259, 1998).
16. M. X. Goemans, A. V. Goldberg, S. Plotkin, D. B. Shmoys, É. Tardos, and D. P. Williamson. Improved approximation algorithms for network design problems. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 223-232, 1994.
17. A. Gupta, A. Kumar, J. Kleinberg, R. Rastogi, and B. Yener. Provisioning a Virtual Private Network: A network design problem for multicommodity flow. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 389-398, 2001.
18. G. F. Italiano, R. Rastogi and B. Yener. Restoration Algorithms for Virutal Private Networks in the Hose Model. In Proceedings of Infocom 2002, to appear.
19. K. Jain. A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica, 21(1):39-60, 2001.
20. (Preliminary version in: 39th Annual Symposium on Foundations of Computer Science, pages 448-457, 1998).
21. M. Kodialam and T. V. Lakshman. Minimum Interference Routing with Applications to MPLS Traffic Engineering. Infocom 2000, pages 884-893, 2000.
22. M. Kodialam and T. V. Lakshman. Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration. Infocom 2000, pages 902-911, 2000.
23. R. Motwani, S. Phillips and E. Torng. Non-clairvoyant scheduling. Theoretical Computer Science, 130:17-47, 1994.
24. J. W. Suurballe. Disjoint paths in a network. Networks, 4: 125-145, 1974.
25. D. P. Williamson, M. X. Goemans, M. Mihail, and V. V. Vazirani. A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica, 15(3):435-454, 1995.
26. (Preliminary version in: 25th Annual ACM Symposium on Theory of Computing, pages 708-717, 1993).
27. D. Zhou and S. Subramaniam. Survivability in Optical Network. IEEE Network, 14(6):16-23, November/December 2000.