8 August 2003 Polynomial time algorithm for hop-constrained QoS routing
Author Affiliations +
Proceedings Volume 5245, Internet Quality of Service; (2003) https://doi.org/10.1117/12.511062
Event: ITCom 2003, 2003, Orlando, Florida, United States
The basis of a QoS-based routing algorithm is a dynamic network dependent cost function that is used to find the optimal or at least a feasible route across the network. However, all QoS-based routing algorithms suffer from a major drawback. The cost function at the core of the algorithms identifies segments of the network where resources are ample and exploits them to the benefit of connections that would otherwise cross a congested portion of the network. Thus, the algorithms consume more resources than Minimum Hop routing would do when the network traffic is non-stationary and heavy. QoS-based routing, thus, wastes resources and performs poorly compared with Minimum Hop routing in the event of congestion. The crux of the discussion is that whatever is gained at low or medium network loads, is offset at high network loads. What is required is a resilient algorithm that either allows the migration of a QoS-based routing algorithm to a Minimum Hop algorithm at high loads or an algorithm that merges Minimum Hop and QoS characteristics. The study opts for the latter approach and proposes and exhibits a hop constrained QoS routing algorithm that outperforms traditional QoS routing algorithms during simulation. This routing technique is based on an approximation algorithm that solves the hop constrained routing problem. The algorithm is derived from a dynamic programming FPAS scheme and finds the shortest walk for a single source destination pair in a graph with restricted number of hops when all the edge costs are non-negative. Simulated results demonstrate that routing technique based on the algorithm is robust to changes in the traffic pattern and consistently outperforms other QoS based routing techniques under heavy load conditions.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Shekhar Verma, Shekhar Verma, Anil Kishore Saxena, Anil Kishore Saxena, "Polynomial time algorithm for hop-constrained QoS routing", Proc. SPIE 5245, Internet Quality of Service, (8 August 2003); doi: 10.1117/12.511062; https://doi.org/10.1117/12.511062


4K-based intra and interprediction techniques for HEVC
Proceedings of SPIE (April 28 2016)
Web server for priority ordered multimedia services
Proceedings of SPIE (October 16 2001)
Video coding for multiple target audiences
Proceedings of SPIE (December 27 1998)

Back to Top