Shortest Path Routing

Shortest Path Routing is a routing algorithm that belongs to the class of path selection methods in computer networks, distinguished by its determination of the optimal route between nodes based solely on minimizing the cumulative cost or distance metric along network links.

871

Publications

45.8K

Citations

2.1K

Authors

769

Institutions

Publications per year

2017–2026

134

Authors

2.1K

  1. JG
    J.J. Garcia‐Luna‐Aceves

    University of California, Santa Cruz, United States

    14 publications · 1.5K citations

    14

    h-index

  2. EM
    Eytan Modiano

    Massachusetts Institute of Technology, United States

    8 publications · 519 citations

    8

    h-index

  3. GS
    Gangxiang Shen

    Soochow University, China

    7 publications · 302 citations

    7

    h-index

  4. BF
    Bernard Fortz

    Université Libre de Bruxelles, Belgium

    7 publications · 2.3K citations

    7

    h-index

  5. MD
    Martin D. F. Wong

    University of Illinois Urbana-Champaign, United States

    6 publications · 209 citations

    6

    h-index

1–5 of 2.1K

Venues

  1. IEEE/ACM Transactions on Networking

    TON · 23 publications · 2.5K citations

    19

    h-index

  2. ACM SIGCOMM Computer Communication Review

    CCR · 13 publications · 1.1K citations

    13

    h-index

  3. IEEE Journal on Selected Areas in Communications

    14 publications · 2.2K citations

    13

    h-index

  4. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 11 publications · 1.7K citations

    11

    h-index

  5. Networks

    10 publications · 1.1K citations

    10

    h-index

1–5