Capacity-Driven Routing is a routing strategy that belongs to the class of traffic engineering methods in communication networks, distinguished by its principle of dynamically selecting paths based on the available capacity of network links to optimize throughput and minimize congestion.
31
Publications
2.9K
Citations
83
Authors
49
Institutions
Publications per year
2017–2026
5
Parents
Publications
31
Internet traffic engineering by optimizing OSPF weights
Bernard Fortz, Mikkel Thorup · 2002 · 1.1K citations
Marios Mavronicolas, Paul G. Spirakis · 2001 · 183 citations
1–5 of 31
Authors
83
- BN
2
h-index
- MM
2
h-index
- PGPaul G. Spirakis
Computer Technology Institute and Press “DIOPHANTUS”, Greece
2 publications · 238 citations
2
h-index
- OB
2
h-index
- BB
2
h-index
1–5 of 83
Institutions
49
University of Massachusetts Amherst
Amherst Center, United States
3 h-index
8 publications
1.6K citations
University of York
York, United Kingdom
2 h-index
3 publications
68 citations
University of Cyprus
Nicosia, Cyprus
2 h-index
2 publications
238 citations
University of Patras
Pátrai, Greece
2 h-index
2 publications
238 citations
Computer Technology Institute and Press “DIOPHANTUS”
Pátrai, Greece
2 h-index
2 publications
238 citations
Sichuan University
Chengdu, China
1 h-index
4 publications
76 citations
University of Edinburgh
Edinburgh, United Kingdom
1 h-index
2 publications
70 citations
Cognitive Research (United States)
St. Petersburg, United States
1 h-index
1 publications
15 citations
1–8 of 49
Venues
- IEEE Journal on Selected Areas in Communications
3 publications · 62 citations
3
h-index
- Physica A Statistical Mechanics and its Applications
2 publications · 31 citations
2
h-index
- Discrete Optimization
1 publications · 21 citations
1
h-index
- International Journal of Communication Systems
1 publications · 15 citations
1
h-index
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
1 publications · 22 citations
1
h-index
1–5