Constraint-based Routing
Constraint-Based Routing is a routing methodology that belongs to the class of route planning techniques and is differentiated by its incorporation of specific constraints—such as resource limitations, quality-of-service requirements, or network policies—to determine feasible paths that satisfy predefined operational conditions.
105
Publications
5.2K
Citations
274
Authors
134
Institutions
Publications per year
2017–2026
14
Parents
105
Traffic engineering with MPLS in the Internet
XiPeng Xiao, A. Hannan, B. Bailey et al. · IEEE Network · 2000 · 322 citations
Concepts of Exact QoS Routing Algorithms
P. VanMieghem, Fernando Kuipers · IEEE/ACM Transactions on Networking · 2004 · 267 citations
1–5 of 105
274
4
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 274
134

Delft University of Technology
Delft, The Netherlands
4 h-index
6 publications
1.3K citations
Universitat Politècnica de Catalunya
Barcelona, Spain
3 h-index
8 publications
163 citations
TU Dortmund University
Dortmund, Germany
3 h-index
9 publications
408 citations
Universitat Oberta de Catalunya
Barcelona, Spain
3 h-index
5 publications
258 citations
Palo Alto Research Center
Palo Alto, United States
2 h-index
5 publications
122 citations
Georgia Institute of Technology
Atlanta, United States
2 h-index
2 publications
81 citations
Wuhan University
Wuhan, China
2 h-index
2 publications
30 citations
Chungnam National University
Daejeon, South Korea
2 h-index
5 publications
114 citations
1–8 of 134
5 publications · 687 citations
5
h-index
4 publications · 208 citations
4
h-index
4 publications · 184 citations
4
h-index
3 publications · 462 citations
3
h-index
JNCA · 3 publications · 99 citations
3
h-index
1–5