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

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

doi:10.1109/MCOM.2002.1106159

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

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

Research output: Contribution to journal › Article › peer-review

269 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 language	English (US)
Pages (from-to)	50-55
Number of pages	6
Journal	IEEE Communications Magazine
Volume	40
Issue number	12
DOIs	https://doi.org/10.1109/MCOM.2002.1106159
State	Published - Dec 2002

ASJC Scopus subject areas

Computer Science Applications
Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/MCOM.2002.1106159

Cite this

@article{139d8ea8d2644bb78821f0bea3a755c9,

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 Marwan Krunz",

note = "Funding Information: The work of M. Krunz was supported by the National Science Foundation under grants ANI 9733143, CCR 9979310, and ANI 0095626.",

year = "2002",

month = dec,

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

N1 - Funding Information: The work of M. Krunz was supported by the National Science Foundation under grants ANI 9733143, CCR 9979310, and ANI 0095626.

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 - https://www.scopus.com/pages/publications/0036904559

UR - https://www.scopus.com/pages/publications/0036904559#tab=citedBy

U2 - 10.1109/MCOM.2002.1106159

DO - 10.1109/MCOM.2002.1106159

M3 - Article

SN - 0163-6804

VL - 40

SP - 50

EP - 55

JO - IEEE Communications Magazine

JF - IEEE Communications Magazine

IS - 12

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this