.png){kind=icon}
Return
Performance evaluation of constraint-based path selection algorithms
.png){kind=icon}
OA
AI
DOI：10.1109/MNET.2004.1337731.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Constraint-based path selection is an invaluable part of a full-fledged quality of service (QoS) architecture. Internet service providers want to be able to select paths for QoS flows that optimize network utilization and satisfy user requirements and as such increase revenues. Unfortunately, finding a path subject to multiple constraints is known to be an NP-complete problem. Hence, accurate constraint-based path selection algorithms with a fast running time are scarce. Numerous heuristics and a few exact algorithms have been proposed. In this-article we compare most of these algorithms. We focus on restricted shortest path algorithms and multi-constrained path algorithms. The performance evaluation of these two classes of algorithms is presented based on complexity analysis and simulation results and may shed some light on the difficult task of selecting the proper algorithm for a QoS-capable network.
Keywords:
MULTIPLE
QUALITY
Journal
IF:
6.3
Papers:
2.7K
Citations:
1.1W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave no more
no more