On finding multi-constrained paths

New emerging distributed multimedia applications provide guaranteed end-to-end quality of service (QoS) and have stringent constraints on delay, delay-jitter, cost, etc. The task of QoS routing is to find a route in the network which has sufficient resources to satisfy the constraints. The delay-cos...

Full description

Saved in:
Bibliographic Details
Published in1998 IEEE International Conference on Communications Vol. 2; pp. 874 - 879 vol.2
Main Authors Shigang Chen, Nahrstedt, K.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1998
Subjects
Algorithm design and analysis
Analytical models
Costs
Delay
Heuristic algorithms
NP-complete problem
Performance analysis
Polynomials
Quality of service
Routing
Online AccessGet full text

Cover

More Information
Summary:New emerging distributed multimedia applications provide guaranteed end-to-end quality of service (QoS) and have stringent constraints on delay, delay-jitter, cost, etc. The task of QoS routing is to find a route in the network which has sufficient resources to satisfy the constraints. The delay-cost-constrained routing problem is NP-complete. We propose a heuristic algorithm for this problem. The idea is to first reduce the NP-complete problem to a simpler one which can be solved in polynomial time, and then solve the new problem by either an extended Dijkstra's algorithm or an extended Bellman-Ford algorithm. We prove the correctness of our algorithm by showing that a solution for the simpler problem must also be a solution for the original problem. The performance of the algorithm is studied by both theoretical analysis and simulation.
ISBN:0780347889
9780780347885
DOI:10.1109/ICC.1998.685137