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

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

Research output: Contribution to journalArticle

236 Citations (Scopus)

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

Fingerprint

Quality of service
Heuristic algorithms

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

An overview of constraint-based path selection algorithms for QoS routing. / Kuipers, Fernando; Van Mieghem, Piet; Korkmaz, Turgay; Krunz, Marwan M.

In: IEEE Communications Magazine, Vol. 40, No. 12, 12.2002, p. 50-55.

Research output: Contribution to journalArticle

Kuipers, Fernando ; Van Mieghem, Piet ; Korkmaz, Turgay ; Krunz, Marwan M. / An overview of constraint-based path selection algorithms for QoS routing. In: IEEE Communications Magazine. 2002 ; Vol. 40, No. 12. pp. 50-55.
@article{ae287d0043024b68af3f1bdcdb074474,
title = "An overview of constraint-based path selection algorithms for QoS routing",
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.",
author = "Fernando Kuipers and {Van Mieghem}, Piet and Turgay Korkmaz and Krunz, {Marwan M}",
year = "2002",
month = "12",
doi = "10.1109/MCOM.2002.1106159",
language = "English (US)",
volume = "40",
pages = "50--55",
journal = "IEEE Communications Magazine",
issn = "0163-6804",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

TY - JOUR

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

AU - Kuipers, Fernando

AU - Van Mieghem, Piet

AU - Korkmaz, Turgay

AU - Krunz, Marwan M

PY - 2002/12

Y1 - 2002/12

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/MCOM.2002.1106159

DO - 10.1109/MCOM.2002.1106159

M3 - Article

AN - SCOPUS:0036904559

VL - 40

SP - 50

EP - 55

JO - IEEE Communications Magazine

JF - IEEE Communications Magazine

SN - 0163-6804

IS - 12

ER -