An overview of constraint-based path selection algorithms for Qos routing Overview of Constraint-Based Path Selection Algorithms for QoS Routing

An overview of constraint-based path selection algorithms for Qos routing Overview of Constraint-Based Path Selection Algorithms for QoS Routing
复制标题

DOI：
--
复制
发表时间：
2002
期刊：
--
影响因子：
--
通讯作者：
Van Mieghem
Van Mieghem
中科院分区：
其他
文献类型：
--
作者：
Van Mieghem

文献摘要

被引文献

相似文献

基于约束的路径选择旨在识别满足一组服务质量(QoS)约束(CID：222)的路径。一般说来，这个问题是NP完全的，这导致了许多启发式算法的提出。本文对这些算法进行了综述，重点介绍了受限最短路径算法和多约束路径算法。
Constraint-based path selection aims at identifying a path that satis (cid:222) es 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 paper, we provide an overview of these algorithms, focusing on restricted shortest path and multi-constrained path algorithms.