logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Performance evaluation of constraint-based path selection algorithms

delete2004-09-01
delete55
delete
OA
AI
F
Fernando Kuipers
T
Turgay Korkmaz
M
Marwan Krunz
P
Piet Van Mieghem
DOI：10.1109/MNET.2004.1337731delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

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

IEEE Network cover
IEEE Network
IF:
6.3
Papers:
2.6K
Citations:
1.1W

Organization

No organization information available