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

Authors

97

  1. JA
    Juan A. Carral

    Universidad de Alcalá, Spain

    2 publications · 24 citations

    2

    h-index

  2. AG
    A. Giorgetti

    Scuola Superiore Sant'Anna, Italy

    2 publications · 86 citations

    2

    h-index

  3. MS
    Michael Schapira

    Hebrew University of Jerusalem, Israel

    2 publications · 168 citations

    2

    h-index

  4. MC
    Marco Chiesa

    KTH Royal Institute of Technology, Sweden

    2 publications · 168 citations

    2

    h-index

  5. TH
    Tao Huang

    Beijing University of Posts and Telecommunications, China

    2 publications · 193 citations

    2

    h-index

1–5 of 97

Venues

  1. IEEE Communications Surveys & Tutorials

    ComST · 1 publications · 178 citations

    1

    h-index

  2. IEEE Transactions on Network and Service Management

    TNSM · 1 publications · 19 citations

    1

    h-index

  3. IEEE/ACM Transactions on Networking

    TON · 1 publications · 123 citations

    1

    h-index

  4. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 1 publications · 25 citations

    1

    h-index

  5. 1

    h-index

1–5