An overview of constraint-based path selection algorithms for QoS routing
Fernando A. Kuipers, Piet Van Mieghem, Turgay Korkmaz, Marwan Krunz · IEEE Communications Magazine · 2002
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.