• DocumentCode
    869031
  • Title

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

  • Author

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

  • Author_Institution
    Delft Univ. of Technol., Netherlands
  • Volume
    40
  • Issue
    12
  • fYear
    2002
  • fDate
    12/1/2002 12:00:00 AM
  • Firstpage
    50
  • Lastpage
    55
  • 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.
  • Keywords
    computational complexity; quality of service; telecommunication network routing; NP-complete problem; QoS constraints; QoS routing; constraint-based path selection algorithms; heuristic algorithms; multi-constrained path algorithms; quality of service; restricted shortest path algorithms; Approximation algorithms; Cost function; Delay; Heuristic algorithms; NP-complete problem; Polynomials; Proposals; Quality of service; Routing; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Communications Magazine, IEEE
  • Publisher
    ieee
  • ISSN
    0163-6804
  • Type

    jour

  • DOI
    10.1109/MCOM.2002.1106159
  • Filename
    1106159
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=869031