An overview of constraint-based path selection algorithms for QoS routing

Fernando Kuipers, Piet Van Mieghem, Turgay Korkmaz, Marwan Krunz

Research output: Contribution to journalArticle

243 Scopus citations

Abstract

Constraint-based path selection aims at identifying a path that satisfies a set of quality of service (QoS) constraints. In general, this problem is known to be NP-complete, leading to the proposal of many heuristic algorithms. In this article we provide an overview of these algorithms, focusing on restricted shortest path and multiconstrained path algorithms.

Original languageEnglish (US)
Pages (from-to)50-55
Number of pages6
JournalIEEE Communications Magazine
Volume40
Issue number12
DOIs
StatePublished - Dec 2002

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'An overview of constraint-based path selection algorithms for QoS routing'. Together they form a unique fingerprint.

  • Cite this