Equal-cost Multi-path Routing
Equal-Cost Multi-Path Routing is a dynamic routing method that enables the distribution of traffic across multiple distinct paths between a source and destination when those paths exhibit identical cumulative routing costs, thereby improving network utilization and resilience without introducing routing loops.
31
Publications
1.7K
Citations
97
Authors
54
Institutions
Publications per year
2017–2026
12
Variants
EcmpEqual-cost Multipath
Parents
31
Naga Praveen Kumar Katta, Mukesh Hira, Changhoon Kim et al. · 2016 · 381 citations · Full text
Load Balancing in Data Center Networks: A Survey
Jiao Zhang, F. Richard Yu, Shuo Wang et al. · IEEE Communications Surveys & Tutorials · 2018 · 178 citations
OpenSample: A Low-Latency, Sampling-Based Measurement Platform for Commodity SDN
Junho Suh, Ted Taekyoung Kwon, Colin Dixon et al. · 2014 · 168 citations
1–5 of 31
97
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 97
54
New York University
New York, United States
3 h-index
8 publications
604 citations

Beijing Institute of Technology
Beijing, China
3 h-index
4 publications
237 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
2 h-index
5 publications
169 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
4 publications
336 citations

Universidad de Alcalá
Alcalá de Henares, Spain
2 h-index
10 publications
120 citations

Scuola Superiore Sant'Anna
Pisa, Italy
1 h-index
2 publications
104 citations

Lund University
Lund, Sweden
1 h-index
1 publications
18 citations
University of Kansas
Lawrence, United States
1 h-index
2 publications
38 citations
1–8 of 54
ComST · 1 publications · 178 citations
1
h-index
TNSM · 1 publications · 19 citations
1
h-index
TON · 1 publications · 123 citations
1
h-index
TPDS · 1 publications · 25 citations
1
h-index
1 publications · 176 citations
1
h-index
1–5