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

  • Authors:
  • F. Kuipers;P. Van Mieghem;T. Korkmaz;M. Krunz

  • Affiliations:
  • Delft Univ. of Technol., Netherlands;-;-;-

  • Venue:
  • IEEE Communications Magazine
  • Year:
  • 2002

Quantified Score

Hi-index 0.26

Visualization

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. We provide an overview of these algorithms, focusing on restricted shortest path and multi-constrained path algorithms.