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.
No takes yet. Share an insight, caveat, or question.
Kuipers et al. (2002) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: