Randomized algorithm for finding a path subject to multiple QoS constraints

Turgay Korkmaz, Marwan M Krunz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

Abstract

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(n2), 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.

Original languageEnglish (US)
Title of host publicationConference Record / IEEE Global Telecommunications Conference
PublisherIEEE
Pages1694-1698
Number of pages5
Volume3
StatePublished - 1999
Event1999 IEEE Global Telecommunication Conference - GLOBECOM'99 - Rio de Janeiro, Braz
Duration: Dec 5 1999Dec 9 1999

Other

Other1999 IEEE Global Telecommunication Conference - GLOBECOM'99
CityRio de Janeiro, Braz
Period12/5/9912/9/99

Fingerprint

Quality of service
Computational complexity
heuristics
Heuristic algorithms
Jitter
Polynomials
services
resource
simulation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Korkmaz, T., & Krunz, M. M. (1999). Randomized algorithm for finding a path subject to multiple QoS constraints. In Conference Record / IEEE Global Telecommunications Conference (Vol. 3, pp. 1694-1698). IEEE.

Randomized algorithm for finding a path subject to multiple QoS constraints. / Korkmaz, Turgay; Krunz, Marwan M.

Conference Record / IEEE Global Telecommunications Conference. Vol. 3 IEEE, 1999. p. 1694-1698.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Korkmaz, T & Krunz, MM 1999, Randomized algorithm for finding a path subject to multiple QoS constraints. in Conference Record / IEEE Global Telecommunications Conference. vol. 3, IEEE, pp. 1694-1698, 1999 IEEE Global Telecommunication Conference - GLOBECOM'99, Rio de Janeiro, Braz, 12/5/99.
Korkmaz T, Krunz MM. Randomized algorithm for finding a path subject to multiple QoS constraints. In Conference Record / IEEE Global Telecommunications Conference. Vol. 3. IEEE. 1999. p. 1694-1698
Korkmaz, Turgay ; Krunz, Marwan M. / Randomized algorithm for finding a path subject to multiple QoS constraints. Conference Record / IEEE Global Telecommunications Conference. Vol. 3 IEEE, 1999. pp. 1694-1698
@inproceedings{3a84f37881404336a804fcb297d98252,
title = "Randomized algorithm for finding a path subject to multiple QoS constraints",
abstract = "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(n2), 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.",
author = "Turgay Korkmaz and Krunz, {Marwan M}",
year = "1999",
language = "English (US)",
volume = "3",
pages = "1694--1698",
booktitle = "Conference Record / IEEE Global Telecommunications Conference",
publisher = "IEEE",

}

TY - GEN

T1 - Randomized algorithm for finding a path subject to multiple QoS constraints

AU - Korkmaz, Turgay

AU - Krunz, Marwan M

PY - 1999

Y1 - 1999

N2 - 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(n2), 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.

AB - 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(n2), 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.

UR - http://www.scopus.com/inward/record.url?scp=0033294989&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033294989&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0033294989

VL - 3

SP - 1694

EP - 1698

BT - Conference Record / IEEE Global Telecommunications Conference

PB - IEEE

ER -