Quality of service routing: Heuristics and approximation schemes with a comparative evaluation

Proceedings - IEEE International Symposium on Circuits and Systems

Volumn 3, Issue , 2002, Pages 775-778

  Ravindran, Ravi ^a   Thulasiraman, K ^b   Das, Anindya ^c   Huang, Kaiyuan ^a   Luo, Gang ^a   Xue, Guoliang ^d  

^a NORTEL NETWORKS   (Canada)

^b UNIVERSITY OF OKLAHOMA   (Canada)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

^d ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; GRAPH THEORY; HEURISTIC METHODS; NETWORK PROTOCOLS; QUALITY OF SERVICE; RANDOM PROCESSES; ROUTERS;

BELLMAN-FORD-MOORE ALGORITHM; BOUNDED DELAY MINIMUM COST PATH ALGORITHM; LAGRANGIAN-RELAXATION BASED HEURISTIC; ROUTING;

DATA COMMUNICATION SYSTEMS;

EID: 0036287447     PISSN: 02714310     EISSN: None     Source Type: Journal    
DOI: 10.1109/ISCAS.2002.1010339     Document Type: Article

References (11)

1. Algorithms for finding paths with multiple constraints
2. Quality-of-service routing for supporting multimedia applications
3. Distributed scalable routing based on vectors of link states
4. A distributed algorithm for delay-constrained unicast routing
5. QoS routing in networks with inaccurate information: Theory and algorithms
6. The design and evaluation of routing algorithms for real-time channels
7. Multi-Qos constraints based routing for IP and ATM networks
8. Lagragian relaxation based method for the QoS routing problem
9. Approximation schemes for the restricted shortest path problem
10. Distributed and sequential heuristics for QoS routing in communication networks