An efficient algorithm for finding a path subject to two additive constraints

Computer Communications

Volumn 25, Issue 3, 2002, Pages 225-238

  Korkmaz, Turgay ^a   Krunz, Marwan ^a   Tragoudas, Spyros ^b  

^a University of Arizona   (United States)

^b Southern Illinois University at Carbondale   (United States)

Author keywords

Additive constraints; Lagrangian techniques; Path selection; QoS routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; HEURISTIC METHODS; POLYNOMIALS; QUALITY OF SERVICE;

COMPUTATIONAL COSTS; LANGRAGIAN TECHNIQUES;

PACKET NETWORKS;

EID: 0037082691     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(01)00358-9     Document Type: Article

References (36)

1. Shortest chain subject to side constraints
2. QoS routing mechanisms and OSPF extensions
3. Quality of service based routing: A performance perspective
4. An approximate algorithm for combinatorial optimization problems with two parameters
5. On finding multi-constrained paths
6. An overview of quality-of-service routing for the next generation high-speed networks: Problems and solutions
7. Strategic directions in networks and telecommunications
8. A framework for QoS-based routing in the Internet
9. A multiple quality of service routing algorithm for PNNI
10. Finding the k shortest paths
11. QoS routing in networks with inaccurate information: Theory and algorithms
12. Search space reduction in QoS routing
13. Approximation schemes for the restricted shortest path problem
14. A delay-constrained least-cost path routing protocol and the synthesis method
15. ATM routing algorithms with multiple QOS requirements for multimedia internetworking
16. Algorithms for finding paths with multiple constraints
17. A randomized algorithm for finding a path subject to multiple QoS constraints
18. QoS based routing for integrated multimedia services
19. Routing subject to quality of service constraints in integrated communication networks
20. On path selection for traffic with bandwidth guarantees
21. Routing traffic with quality-of-service guarantees in integrated services networks
22. Routing with end-to-end QoS guarantees in broadband networks
23. QoS based routing algorithm in integrated services packet networks
24. A distributed algorithm for delay-constrained unicast routing
25. Solving k-shortest and constrained shortest path problems efficiently
26. Distributed routing algorithm for supporting delay-sensitive applications
27. Quality-of-service routing using maximally disjoint paths
28. QoS-based routing of multimedia streams in computer networks
29. Quality-of-service routing for supporting multimedia applications
30. Internet QoS: A big picture