Randomized algorithm for finding a path subject to multiple QoS constraints

Turgay Korkmaz, Marwan Krunz

Research output: Contribution to conferencePaper

19 Scopus citations

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)
Pages1694-1698
Number of pages5
StatePublished - Dec 1 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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Fingerprint Dive into the research topics of 'Randomized algorithm for finding a path subject to multiple QoS constraints'. Together they form a unique fingerprint.

  • Cite this

    Korkmaz, T., & Krunz, M. (1999). Randomized algorithm for finding a path subject to multiple QoS constraints. 1694-1698. Paper presented at 1999 IEEE Global Telecommunication Conference - GLOBECOM'99, Rio de Janeiro, Braz, .