A randomized algorithm for finding a path subject to multiple QoS constraints

An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies end-to-end QoS requirements of a connection request while efficiently using network resources. In general, finding a path subject to multiple additive constraint...

Full description

Saved in:
Bibliographic Details
Published in:Global Telecommunications Conference (GLOBECOM), 1999 IEEE Vol. 3; pp. 1694 - 1698 vol.3
Main Authors: Korkmaz, T., Krunz, M.
Format: Conference Proceeding
Language:English
Published: IEEE 1999
Subjects:
Approximation algorithms
Bandwidth
Computational complexity
Computer networks
Costs
Delay
Heuristic algorithms
Polynomials
Quality of service
Routing
ISBN:0780357965, 9780780357969
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies end-to-end QoS requirements of a connection request while efficiently using network resources. In general, finding a path subject to multiple additive constraints (e.g., delay, delay-jitter) is an NP-complete problem. For this problem, we propose a randomized heuristic algorithm with polynomial-time complexity. Our algorithm first prunes all the links that cannot be on any feasible paths. It then uses a randomized heuristic search to find a feasible path, if one exists. The worst-case computational complexity of our algorithm is O(n/sup 2/), where n is the number of nodes. The storage complexity of the algorithm is O(n). Using extensive simulations, we show that our algorithm gives very high success rate in finding feasible paths.
ISBN:0780357965
9780780357969
DOI:10.1109/GLOCOM.1999.832452