Abstract
Constraint-based routing is an invaluable part of a full-fledged Quality of Service architecture. Unfortunately, QoS routing with multiple additive constraints is known to be a NP-complete problem. Hence, accurate constraint-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The need for such algorithms has resulted in the proposal of numerous heuristics and a few exact solutions. This chapter presents a thorough, concise, and fair evaluation of the most important multi-constrained path selection algorithms known today. A performance evaluation of these algorithms is presented based on a complexity analysis and simulation results. Besides the routing algorithm, dynamic aspects of QoS routing are discussed: how to cope with incomplete or inaccurate topology information and (in)stability issues.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 80-117 |
| Number of pages | 38 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 2856 |
| State | Published - 2003 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Biochemistry, Genetics and Molecular Biology(all)
- Theoretical Computer Science
Cite this
Quality of service routing. / Van Mieghem, P.; Kuipers, F. A.; Korkmaz, T.; Krunz, Marwan M; Curado, M.; Monteiro, E.; Masip-Bruin, X.; Solé-Pareta, J.; Sánchez-López, S.
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2856, 2003, p. 80-117.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Quality of service routing
AU - Van Mieghem, P.
AU - Kuipers, F. A.
AU - Korkmaz, T.
AU - Krunz, Marwan M
AU - Curado, M.
AU - Monteiro, E.
AU - Masip-Bruin, X.
AU - Solé-Pareta, J.
AU - Sánchez-López, S.
PY - 2003
Y1 - 2003
N2 - Constraint-based routing is an invaluable part of a full-fledged Quality of Service architecture. Unfortunately, QoS routing with multiple additive constraints is known to be a NP-complete problem. Hence, accurate constraint-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The need for such algorithms has resulted in the proposal of numerous heuristics and a few exact solutions. This chapter presents a thorough, concise, and fair evaluation of the most important multi-constrained path selection algorithms known today. A performance evaluation of these algorithms is presented based on a complexity analysis and simulation results. Besides the routing algorithm, dynamic aspects of QoS routing are discussed: how to cope with incomplete or inaccurate topology information and (in)stability issues.
AB - Constraint-based routing is an invaluable part of a full-fledged Quality of Service architecture. Unfortunately, QoS routing with multiple additive constraints is known to be a NP-complete problem. Hence, accurate constraint-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The need for such algorithms has resulted in the proposal of numerous heuristics and a few exact solutions. This chapter presents a thorough, concise, and fair evaluation of the most important multi-constrained path selection algorithms known today. A performance evaluation of these algorithms is presented based on a complexity analysis and simulation results. Besides the routing algorithm, dynamic aspects of QoS routing are discussed: how to cope with incomplete or inaccurate topology information and (in)stability issues.
UR - http://www.scopus.com/inward/record.url?scp=35248857064&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=35248857064&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:35248857064
VL - 2856
SP - 80
EP - 117
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
SN - 0302-9743
ER -