Building edge-failure resilient networks

Algorithmica (New York)

Volumn 43, Issue 1-2, 2005, Pages 17-41

  Chekuri, Chandra ^a   Gupta, A ^b   Kumar, Amit ^c   Naor, J ^d   Raz, Danny ^d  

^a LUCENT TECHNOLOGIES   (United States)

^b Carnegie Mellon University ^*  (United States)

^c INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation algorithm; Backup path; Link failure; Network design; Restoration

Indexed keywords

ALGORITHMS; COMPUTER SYSTEM RECOVERY; FAULT TOLERANT COMPUTER SYSTEMS; PROBLEM SOLVING; RESTORATION; STORAGE ALLOCATION (COMPUTER); TREES (MATHEMATICS);

APPROXIMATION ALGORITHM; BACKUP PATH; LINK FAILURE; NETWORK DESIGN;

COMPUTER NETWORKS;

EID: 23944522861     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-005-1156-z     Document Type: Article

References (38)

1. B. Awerbuch and Y. Azur. Buy-at-bulk network design. In Proceedings of IEEE FOCS, pages 542-547, 1997.
2. A. Balakrishnan, T. Magnanti, and P. Mirchandani. Network design. In Annotated Bibliographies in Combinatorial Optimization, M. Dell'Amico, F. Maffioli, and S. Martello (eds.), pages 311-334. Wiley, New York, 1997.
3. A. Balakrishnan, T. Magnanti, J. Sokol, and Y. Wang. Telecommunication link restoration planning with multiple facility types. Annals of Operations Research (volume "Topological Network Design in Telecommunications," edited by P. Kubat and J. M. Smith), 106(1-4):127-154, 2001.
4. A. Balakrishnan, T. Magnanti, J. Sokol, and Y. Wang. Spare-capacity assignment for line restoration using a single-facility type. Operations Research, 50(4):617-635, 2002.
5. D. Bienstock and G. Muratore. Strong inequalities for capacitated survivable network design problems. Mathematical Programming, 89:127-147, 2001.
6. A. Bremler-Barr, Y. Afek, E. Cohen, H. Kaplan, and M. Merritt. Restoration by path concatenation: fast recovery of MPLS paths. In Proceedings of ACM PODC '01, pages 43-52;
7. also in Proceedings of the ACM SIGMETRICS '01 Conference (2-Page Poster), 2001.
8. G. Brightwell, G. Oriolo, and F. B. Shepherd. Reserving resilient capacity in a network. SIAM Journal on Discrete Mathematics, 14(4):524-539, 2001.
9. G. Brightwell, G. Oriolo, and F. B. Shepherd. Reserving resilient capacity with upper bound constraints. Networks, 41(2):87-96, 2003.
10. G. Dahl and M. Stoer. A cutting plane algorithm for multicommodity survivable network design problems. INFORMS Journal on Computing, 10:1-11, 1998.
11. B. Davie and Y. Rekhter. MPLS: Technology and Applications. Morgan Kaufmann, San Mateo, CA, 2000.
12. N. Duffield, P. Goyal, A. Greenberg, P. Mishra, K. Ramakrishnan, and J. van der Merwe. A flexible model for resource management in virtual private networks. In Proceedings of ACM SIGCOMM, Computer Communication Review, volume 29, pages 95-108, 1999.
13. L. Fleischer, A. Meyerson, I. Saniee, F. B. Shepherd, and A. Srinivasan. Near-optimal design of MPλS tunnels with shared recovery. DIMACS Mini-Workshop on Quality of Service Issues in the Internet, 2001.
14. G. N. Frederickson and J. JáJá. Approximation algorithms for several graph augmentation problems. SIAM Journal on Computing, 10(2):270-283, 1981.
15. A. Fumagalli and L. Valcarenghi. IP restoration vs. WDM protection: is there an optimal choice? IEEE Network, 14(6):34-41, November/December 2000.
16. 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.
17. (Preliminary version in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 253-259, 1998.)
18. M. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, E. Tardos, and D. Williamson. Improved approximation algorithms for network design problems. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 223-232, 1994.
19. 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.
20. 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.
21. A. Gupta, A. Kumar, and R. Rastogi. Traveling with a Fez dispenser (or, routing issues in MPLS). In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (Las Vegas, NV, 2001), pages 148-157. IEEE Computer Society Press, Los Alamitos, CA, 2001.
22. A. Gupta, A. Kumar, and T. Roughgarden. Simpler and better approximation algorithms for network design. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 365-372, 2003.
23. E. Halperin and R. Krauthgamer. Polylogarithmic inapproximability. In Proceedings of the 35th ACM Symposium on Theory of Computing, pages 585-594. ACM Press, New York, 2003.
24. G. Italiano, R. Rastogi, and B. Yener. Restoration algorithms for virutal private networks in the hose model. Proceedings of Infocom 2002.
25. K. Jain. A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica, 21(1):39-60, 2001.
26. (Preliminary version in Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pages 448-457, 1998.)
27. M. Kodialam and T. V. Lakshman. Minimum interference routing with applications to MPLS traffic engineering. Proceedings of Infocom 2000, pages 884-893, 2000.
28. M. Kodialam and T. V. Lakshman. Dynamic routing of bandwidth guaranteed tunnels with restoration. Proceedings of Infocom 2000, pages 902-911, 2000.
29. R. Motwani, S. Phillips, and E. Torng. Non-clairvoyant scheduling. Theoretical Computer Science, 130:17-47, 1994.
30. R. Ramaswami and K. Sivarajan. Optical Networks. 2nd edition. Morgan Kaufmann, San Mateo, CA, October 2001.
31. E. C. Rosen, D. Tappan, Y. Rekhter, G. Federkow, D. Farinacci, T. Li, and A. Conta. MPLS label stack encoding (RFC 3032). http://www.ietf.org/rfc/rfc3032.txt, January 2001.
32. E. C. Rosen, A. Viswanathan, and R. Callon. MultiProtocol Label Switching architecture (RFC 3031). http://www.ietf.org/rfc/rfc3031.txt, January 2001.
33. F. S. Salman, J. Cheriyan, R. Ravi, and S. Subramanian. Buy-at-bulk network design: approximating the single-sink edge installation problem. In Proceedings of 8th ACM-SIAM SODA, pages 619-628, 1997.
34. C. Scott, P. Wolfe, M. Erwin, and A. Oram. Virtual Private Networks. O'Reilly, Cambridge, MA, 1998.
35. J. W. Suurballe. Disjoint paths in a network. Networks, 4:125-145, 1974.
36. D. Williamson, M. Goemans, M. Mihail, and V. Vazirani. A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica, 15(3):435-454, 1995.
37. (Preliminary version in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 708-717, 1993.)
38. D. Zhou and S. Subramaniam. Survivability in optical network. IEEE Network, 14(6): 16-23, 2000.