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

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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer networks (Amsterdam, Netherlands : 1999) Ročník 36; číslo 2; s. 251 - 268
Hlavní autoři: Korkmaz, Turgay, Krunz, Marwan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.07.2001
Elsevier Sequoia S.A
Témata:
Algorithms
Constraints
Heuristic
Jitter
Multi-constrained path selection
Networks
QoS-based routing
Quality of service
Routing
Scalable routing
Selection
Studies
QoS-based routing
Scalable routing
Multi-constrained path selection
ISSN:1389-1286, 1872-7069
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies a set of end-to-end QoS requirements (or constraints) 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. We propose an efficient randomized heuristic algorithm to this problem. Although the algorithm is presented as a centralized one, the idea behind it can also be implemented in a distributed manner. Our algorithm initially computes the cost of the best path from each node to a given destination with respect to individual link weights and their linear combination. In this initialization step, Reverse–Dijkstra's algorithm is used K+1 times per path request, where K is the number of additive constraints. The algorithm then randomly traverses the graph, discovering nodes from which there is a good chance of reaching the final destination. This randomized search is a modification of the breadth-first search (BFS). Using extensive simulations, we show that the proposed algorithm provides better performance than existing algorithms under the same order of computational complexity.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1389-1286
1872-7069
DOI:10.1016/S1389-1286(00)00209-7