Algorithms for computing QoS paths with restoration

IEEE/ACM Transactions on Networking

Volumn 13, Issue 3, 2005, Pages 648-661

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

^a LUCENT TECHNOLOGIES   (United States)

^b KENT STATE UNIVERSITY   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithms; QoS routing; Restoration; Restricted shortest path

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ROUTERS; TELECOMMUNICATION LINKS; THEOREM PROVING;

QOS ROUTING; RESTRICTED SHORTEST PATH;

QUALITY OF SERVICE;

EID: 23344436177     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.850217     Document Type: Article

References (21)

1. A. Barabasi and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, pp. 509-512, 1999.
2. Y. Bejerano, Y. Breitbart, A. Orda, R. Rastogi, and A. Sprintson. (2002) Algorithms for Computing QoS Paths With Restoration. Department of Electrical Engineering, Technion, Haifa, Israel. [Online]. Available: ftp://ftp.technion.ac.il/pub/supported/ee/Network/os02.pdf
3. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.
4. E. Crawley, R. Nair, B. Rajagopalan, and H. Sandick, "A Framework for QoS-Based Routing in the Internet," Internet RFC 2386, 1998.
5. F. Ergun, R. Sinha, and L. Zhang, "An improved FPTAS for restricted shortest path,Inform. Process. Lett., vol. 83, no. 5, pp. 237-293, Sep. 2002.
6. M. R. Garey and D. S. Johnson, Computers and Intractability. San Francisco, CA: Freeman, 1979.
7. R. Hassin, "Approximation schemes for the restricted shortest path problem," Math. Oper. Res., vol. 17, no. 1, pp. 36-42, Feb. 1992.
8. R. R. Iraschko and W. D. Grover, "A highly efficient path-restoration protocol for management of optical network transport integrity," IEEE J. Select. Areas Commun., vol. 18, no. 5, pp. 779-793, May 2000.
9. G. Italiano, R. Rastogi, and B. Yener, "Restoration algorithms for virtual private networks in the Hose model," in Proc. IEEE INFOCOM, New York, NY, Jun. 2002.
10. K. Kar, M. Kodialam, and T. V. Lakshman, "Routing restorable bandwidth guaranteed connections using maximum 2-route flows," IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 772-781, Oct. 2003.
11. M. S. Kodialam and T. V. Lakshman, "Dynamic routing of bandwidth guaranteed tunnels with restoration," in Proc. IEEE INFOCOM, Tel-Aviv, Israel, Mar. 2000.
12. R. R. Kodialam and T. V. Lakshman, "Restorable dynamic QoS routing," IEEE Commun. Mag., vol. 40, no. 6, pp. 72-81, Jun. 2002.
13. G. Krishna, M. Pradeep, and C. R. Murthy, "A segmented backup scheme for dependable real time communication in multihop networks," in Proc. Workshop on Parallel and Distributed Real-Time Systems (WPDRTS'2000), Cancun, Mexico, May 2000.
14. G. Li, D. Wang, C. Kalmanek, and R. Doverspike, "Efficient distributed path selection for shared restoration connections," in Proc. IEEE INFOCOM, New York, NY, Jun. 2002.
15. D. H. Lorenz and D. Raz, "A simple efficient approximation scheme for the restricted shortest path problem," Oper. Res. Lett., vol. 28, no. 5, pp. 213-219, Jun. 2001.
16. Q. Ma and P. Steenkiste, "Quality of service routing for traffic with performance guarantees," in Proc. Int. Workshop on Quality of Service (IWQoS'97), New York, NY, May 1997.
17. A. Medina, A. Lakhina, I. Matta, and J. Byers, "Brite: Universal topology generation from a user's perspective," in Proc. Workshop Int. Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (MASCOTS '01), Cincinnati, OH, Aug. 2001.
18. A. Orda, "Routing with end to end QoS guarantees in broad-band networks," IEEE/ACM Trans. Networking, vol. 7, no. 3, pp. 365-374, Jun. 1999.
19. J. L. Sobrinho, "Algebra and algorithms for QoS path computation and Hop-by-Hop routing in the internet," IEEE/ACM Trans. Networking, vol. 10, no. 4, pp. 541-550, Aug. 2002.
20. J. Suurballe, "Disjoint paths in a network," Networks, vol. 4, pp. 125-145, 1974.
21. B. M. Waxman, "Routing of multipoint connections," IEEE J. Select. Areas Commun., vol. 6, pp. 1671-1622, 1988.