Efficient algorithms for computing disjoint QoS paths

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2004, Pages 727-738

  Orda, Ariel ^a   Sprintson, Alexander ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Disjoint paths; Quality of service; Restoration; Routing

Indexed keywords

CONSTRAINT THEORY; INTERNET; MULTIMEDIA SYSTEMS; NETWORK PROTOCOLS; PROBLEM SOLVING; QUALITY OF SERVICE; ROUTERS; SET THEORY; VIDEO CONFERENCING;

DESTINATION NODES; DISJOINT PATHS; MULTIPROTOCOL LABEL SWITCHING (MPLS); ROUTING;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 8344255723     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. E. Mannie and D. Papadimitriou (editors), "Recovery (Protection and Restoration) Terminology for Generalized Multi-Protocol Label Switching (GMPLS)," Internet draft. Internet Engineering Task Force, May 2003.
2. J. Suurballe and R. Tarjan, "A Quick Method for Finding Shortest Pairs of Disjoint Paths," Networks, vol. 14, pp. 325-336, 1984.
3. S. Chen and K. Nahrstedt, "An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks: Problems and Solutions," IEEE Network, Special Issue on Transmission and Distribution of Digital Video, vol. 12, no. 6, pp. 64-79, November/December 1998.
4. F.A. Kuipers, T. Korkmaz, M. Krunz, and P. Van Mieghem, "A Review of Constraint-Based Routing Algorithms," in Technical Report, Lausanne, Switzerland, June 2002.
5. K. Kar, M. Kodialam, and T. V. Lakshman, "Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows," in Proceedings of IEEE INFOCOM'2002, New York, NY, USA, June 2002.
6. G. Li, D. Wang, C. Kalmanek, and R. Doverspike, "Efficient Distributed Path Selection for Shared Restoration Connections," in Proceedings of IEEE INFOCOM'2002, New York, NY, USA, June 2002.
7. N. Taft-Plotkin, B. Bellur, and R.G. Ogier, "Quality-of-Service Routing Using Maximally Disjoint Paths," in Proceedings IEEE/IFIP IWQoS, London, UK, June 1999.
8. M.R. Garey and D.S. Johnson, Computers and Intractability, Freeman, San Francisco, CA, USA, 1979.
9. J.P. Lang and B. Rajagopalan (editors), "Generalized MPLS Recovery Functional Specification," Internet draft, Internet Engineering Task Force, January 2003.
10. "Private Network-Network Interface Specification v1.0 (PNNI)," ATM Forum Technical Committee, March 1996.
11. S. Blake, "An architecture for Differentiated Services," RFC No. 2475, Internet Engineering Task Force, December 1998.
12. A. Orda and A. Sprintson, "Precomputation Schemes for QoS Routing," IEEE/ACM Transactions on Networking, vol. 11, no. 4, pp. 578-591, August 2003.
13. I. Cidon, R. Rom, and Y. Shavitt, "Analysis of Multi-path Routing," IEEE/ACM Transactions on Networking, vol. 7, no. 6, pp. 885-896, 1999.
14. S. Lee and M. Gerla, "Split Multipath Routing with Maximally Disjoint Paths in Ad Hoc Networks," in Proceedings of the IEEE ICC'2001, 2001.
15. F. Ergun, R. Sinha, and L. Zhang, "An Improved FPTAS for Restricted Shortest Path," Information Processing Letters, vol. 83, no. 5, pp. 237-293, September 2002.
16. R. Hassin, "Approximation Schemes for the Restricted Shortest Path Problem," Mathematics of Operations Research, vol. 17, no. 1, pp. 36-42, February 1992.
17. D.H. Lorenz and D. Raz, "A Simple Efficient Approximation Scheme for the Restricted Shortest Path Problem," Operations Research Letters, vol. 28, no. 5, pp. 213-219, June 2001.
18. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Networks Flows, Prentice-Hall, NJ, USA, 1993.
19. S. Fortune, J. Hopcroft, and J. Wyllie, "The Directed Subgraph Homeomorphism Problem," Theoretical Computer Science, vol. 10, no. 2, pp. 111-121, 1980.
20. C.L. Li, T. McCormick, and D. Simchi-Levi, "The Complexity of Finding Two Disjoint Paths with Min-Max Objective Function," Discrete Applied Mathematics, vol. 26, pp. 105-115, 1990.
21. Y. Bejerano, Y. Breitbart, A. Orda, R. Rastogi, and A. Sprintson, "Algorithms for Computing QoS Paths with Restoration," in Proceedings of IEEE INFOCOM'2003, San Francisco, CA, USA, April 2003.