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 | |
State | Published - Dec 2002 |
ASJC Scopus subject areas
- Computer Science Applications
- Computer Networks and Communications
- Electrical and Electronic Engineering