An efficient algorithm for finding a path subject to two additive constraints

Turgay Korkmaz, Marwan Krunz, Spyros Tragoudas

Research output: Contribution to journalConference articlepeer-review

46 Scopus citations


One of the key issues in providing end-to-end quality-of-service guarantees in packet networks is how to determine a feasible route that satisfies a set of constraints while simultaneously maintaining high utilization of network resources. In general, finding a path subject to multiple additive constraints (e.g., delay, delay-jitter) is an NP-complete problem that cannot be exactly solved in polynomial time. Accordingly, heuristics and approximation algorithms are often used to address to this problem. Previously proposed algorithms suffer from either excessive computational cost or low performance. In this paper, we provide an efficient approximation algorithm for finding a path subject to two additive constraints. The worst-case computational complexity of this algorithm is within a logarithmic number of calls to Dijkstra's shortest path algorithm. Its average complexity is much lower than that, as demonstrated by simulation results. The performance of the proposed algorithm is justified via theoretical performance bounds. To achieve further performance improvement, several extensions to the basic algorithm are also provided at low extra computational cost. Extensive simulations are used to demonstrate the high performance of the proposed algorithm and to contrast it with other path selection algorithms.

Original languageEnglish (US)
Pages (from-to)318-327
Number of pages10
JournalPerformance Evaluation Review
Issue number1
StatePublished - 2000
EventProceedings ACM SIGMETRICS 2000 - Santa Clara, CA, United States
Duration: Jun 17 2000Jun 21 2000


  • Multiple constrained path selection
  • QoS routing
  • Scalable routing

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'An efficient algorithm for finding a path subject to two additive constraints'. Together they form a unique fingerprint.

Cite this