Path selection under multiple QoS constraints - A practical approach

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


Path selection under multiple additive QoS constraints in high-speed networks is an NP-complete problem. Most of the algorithms proposed for QoS routing suffer from either excessive computational complexities or low performance. In this paper, we propose two practical heuristic algorithms that are based on iterative shortest-path computations with a dynamic cost function. The cost function comprises a combination of several QoS constraints and a single optimization metric. A simulation program evaluates the performance of the algorithms. The simulation results indicate that our algorithms give very high performance and fast running time.

Original languageEnglish
Pages (from-to)155-167
Number of pages13
JournalJournal of High Speed Networks
Issue number2
StatePublished - 20 Dec 2004


  • Mpls
  • Multi-constraints
  • Optimization criteria
  • Quality of service
  • Shortest-path

ASJC Scopus subject areas

  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Path selection under multiple QoS constraints - A practical approach'. Together they form a unique fingerprint.

Cite this