Algorithms for computing QoS paths with restoration

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2003, Pages 1435-1445

  Bejerano, Yigal ^a   Breibart, Yuri ^b   Orda, Ariel ^c   Rastogi, Rajeev ^a   Sprintson, Alexander ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b KENT STATE UNIVERSITY   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation Algorithms; QoS routing; Restoration; Restricted Shortest Path

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; PACKET SWITCHING; QUALITY OF SERVICE; BANDWIDTH; IMAGE RECONSTRUCTION; NETWORK ROUTING; RESTORATION; TOPOLOGY;

MULTIPROTOCOL LABEL SWITCHING (MPLS);

INTERNET; APPROXIMATION ALGORITHMS;

ALTERNATIVE APPROACH; COMPREHENSIVE STUDIES; DELAY AND JITTER; GLOBAL USE; LOW COSTS; NETWORK RESOURCE; NEW SERVICES; OPTIMAL STRATEGIES; PRIMARY PATH; QOS CONSTRAINTS; QOS ROUTING; RESILIENCE TO FAILURE; RESTORATION PATHS; RESTRICTED SHORTEST PATH; RIGOROUS SOLUTION; ROUTING MECHANISM; ROUTING PROCESS; SERVICE PROVIDER;

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

References (19)

1. A. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.
2. Y. Bejerano, Y. Breitbart, A. Orda, R. Rastogi, and A. Sprintson. Algorithms for Computing QoS Paths with Restoration. CCIT Pub. No. 395, Department of Electrical Engineering, Technion, Haifa, Israel, June 2002. Available from ftp://ftp.technion.ac.il/pub/supported/ee/Network/os02.ps.
3. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
4. E. Crawley, R. Nair, B. Rajagopalan, and H. Sandick. A Framework for QoS-based Routing in the Internet - RFC No. 2386. Internet RFC, August 1998.
5. F. Ergun, R. Sinha, and L. Zhang. An Improved FPTAS for Restricted Shortest Path. Information Processing Letters, 83(5):237-293, September 2002.
6. M.R. Garey and D.S. Johnson. Computers and Intractability. Freeman, San Francisco, 1979.
7. R. Hassin. Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 17(1):36-42, February 1992.
8. G. Italiano, R. Rastogi, and B. Yener. Restoration Algorithms for Virtual Private Networks in the Hose Model. In Proceedings of IEEE INFOCOM'02, New York, NY, June 2002.
9. K. Kar, M. Kodialam, and T. V. Lakshman. Routing restorable bandwidth guaranteed connections using maximum 2-route flows. In Proceedings of IEEE INFOCOM'02, New York, NY, June 2002.
10. Murali S. Kodialam and T. V. Lakshman. Dynamic routing of bandwidth guaranteed tunnels with restoration. In Proceedings of IEEE INFOCOM'2000, Tel-Aviv, Israel, March 2000.
11. G. Krishna, M. Pradeep, and C. Ram Murthy. A segmented backup scheme for dependable real time communication in multihop networks. In Proceedings of Workshop on Parallel and Distributed Real-Time Systems (WPDRTS'2000), Cancun, Mexico, May 2000.
12. G. Li, D. Wang, C. Kalmanek, and R. Doverspike. Efficient distributed path selection for shared restoration connections. In Proceedings of IEEE INFOCOM'02, New York, NY, June 2002.
13. D.H. Lorenz and D. Raz. A Simple Efficient Approximation Scheme for the Restricted Shortest Path Problem. Operations Research Letters, 28(5):213-219, June 2001.
14. Q. Ma and P. Steenkiste. Quality of Service Routing for Traffic with Performance Guarantees. In Proceedings of International Workshop on Quality of Service (IWQoS'97), Columbia University, New York, NY, May 1997.
15. A. Medina, A. Lakhina, I. Matta, and J. Byers. Brite: Universal topology generation from a user's perspective. In Proceedings of Workshop the International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (MASCOTS '01), Cincinnati, OH, August 2001.
16. A. Orda. Routing with end to end QoS guarantees in broadband networks. IEEE/ACM Transactions on Networking, 7(3):365-374, June 1999.
17. J. Sobrinho. Algebra and Algorithms for Qos Path Computation and Hop-by-Hop Routing in the Internet. In Proceedings of IEEE INFOCOM'01, Anchorage, Alaska, April 2001.
18. J. Suurballe. Disjoint Path in Networks. Networks, 4:125-145, 1974.
19. B. M. Waxman. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 6(9):1671-1622, 1988.