Performance evaluation of constraint-based path selection algorithms

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

Research output: Contribution to journalArticle

67 Citations (Scopus)

Abstract

Constraint-based path selection is an invaluable part of a full-fledged quality of service (QoS) architecture. Internet service providers want to be able to select paths for QoS flows that optimize network utilization and satisfy user requirements and as such increase revenues. Unfortunately, finding a path subject to multiple constraints is known to be an NP-complete problem. Hence, accurate constraint-based path selection algorithms with a fast running time are scarce. Numerous heuristics and a few exact algorithms have been proposed. In this article we compare most of these algorithms. We focus on restricted shortest path algorithms and multi-constrained path algorithms. The performance evaluation of these two classes of algorithms is presented based on complexity analysis and simulation results and may shed some light on the difficult task of selecting the proper algorithm for a QoS-capable network.

Original languageEnglish (US)
Pages (from-to)16-23
Number of pages8
JournalIEEE Network
Volume18
Issue number5
DOIs
StatePublished - Sep 2004

Fingerprint

Quality of service
Internet service providers
Computational complexity

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems

Cite this

Performance evaluation of constraint-based path selection algorithms. / Kuipers, Fernando; Korkmaz, Turgay; Krunz, Marwan M; Van Mieghem, Piet.

In: IEEE Network, Vol. 18, No. 5, 09.2004, p. 16-23.

Research output: Contribution to journalArticle

Kuipers, Fernando ; Korkmaz, Turgay ; Krunz, Marwan M ; Van Mieghem, Piet. / Performance evaluation of constraint-based path selection algorithms. In: IEEE Network. 2004 ; Vol. 18, No. 5. pp. 16-23.
@article{300b1c36fe9c4d0a8a2363a5db7c7bd9,
title = "Performance evaluation of constraint-based path selection algorithms",
abstract = "Constraint-based path selection is an invaluable part of a full-fledged quality of service (QoS) architecture. Internet service providers want to be able to select paths for QoS flows that optimize network utilization and satisfy user requirements and as such increase revenues. Unfortunately, finding a path subject to multiple constraints is known to be an NP-complete problem. Hence, accurate constraint-based path selection algorithms with a fast running time are scarce. Numerous heuristics and a few exact algorithms have been proposed. In this article we compare most of these algorithms. We focus on restricted shortest path algorithms and multi-constrained path algorithms. The performance evaluation of these two classes of algorithms is presented based on complexity analysis and simulation results and may shed some light on the difficult task of selecting the proper algorithm for a QoS-capable network.",
author = "Fernando Kuipers and Turgay Korkmaz and Krunz, {Marwan M} and {Van Mieghem}, Piet",
year = "2004",
month = "9",
doi = "10.1109/MNET.2004.1337731",
language = "English (US)",
volume = "18",
pages = "16--23",
journal = "IEEE Network",
issn = "0890-8044",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Performance evaluation of constraint-based path selection algorithms

AU - Kuipers, Fernando

AU - Korkmaz, Turgay

AU - Krunz, Marwan M

AU - Van Mieghem, Piet

PY - 2004/9

Y1 - 2004/9

N2 - Constraint-based path selection is an invaluable part of a full-fledged quality of service (QoS) architecture. Internet service providers want to be able to select paths for QoS flows that optimize network utilization and satisfy user requirements and as such increase revenues. Unfortunately, finding a path subject to multiple constraints is known to be an NP-complete problem. Hence, accurate constraint-based path selection algorithms with a fast running time are scarce. Numerous heuristics and a few exact algorithms have been proposed. In this article we compare most of these algorithms. We focus on restricted shortest path algorithms and multi-constrained path algorithms. The performance evaluation of these two classes of algorithms is presented based on complexity analysis and simulation results and may shed some light on the difficult task of selecting the proper algorithm for a QoS-capable network.

AB - Constraint-based path selection is an invaluable part of a full-fledged quality of service (QoS) architecture. Internet service providers want to be able to select paths for QoS flows that optimize network utilization and satisfy user requirements and as such increase revenues. Unfortunately, finding a path subject to multiple constraints is known to be an NP-complete problem. Hence, accurate constraint-based path selection algorithms with a fast running time are scarce. Numerous heuristics and a few exact algorithms have been proposed. In this article we compare most of these algorithms. We focus on restricted shortest path algorithms and multi-constrained path algorithms. The performance evaluation of these two classes of algorithms is presented based on complexity analysis and simulation results and may shed some light on the difficult task of selecting the proper algorithm for a QoS-capable network.

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

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

U2 - 10.1109/MNET.2004.1337731

DO - 10.1109/MNET.2004.1337731

M3 - Article

AN - SCOPUS:6444236350

VL - 18

SP - 16

EP - 23

JO - IEEE Network

JF - IEEE Network

SN - 0890-8044

IS - 5

ER -