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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Global Telecommunications Conference (GLOBECOM), 1999 IEEE Jg. 3; S. 1694 - 1698 vol.3
Hauptverfasser: Korkmaz, T., Krunz, M.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 1999
Schlagworte:
Approximation algorithms
Bandwidth
Computational complexity
Computer networks
Costs
Delay
Heuristic algorithms
Polynomials
Quality of service
Routing
ISBN:0780357965, 9780780357969
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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