An efficient quality of service routing algorithm for delay-sensitive applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
An efficient quality of service routing algorithm for delay-sensitive applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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. Multi-constrained routing is difficult because different constraints can conflict with one another. In particular, 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. When the extended Dijkstra''s algorithm is used, the total time complexity of the heuristic algorithm is O(x^2 V^2); when the extended Bellman-Ford algorithm is used, the total complexity is O(x V E), where x is an integer defined solely by the algorithm. We prove the correctness of our algorithm by showing that a solution to the simpler problem must also be a solution to the original problem. The performance of the algorithm can be adjusted by tuning the value of x. A larger value for x results in a higher probability of finding a solution and a higher overhead.