Fully Adaptive Routing

Fully Adaptive Routing is a routing strategy in computer networks that belongs to the class of adaptive routing protocols and is distinguished by its ability to dynamically select among all available paths to a destination based on real-time network conditions, without restricting the choice to a predetermined subset of paths.

42

Publications

2.5K

Citations

81

Authors

38

Institutions

Publications per year

2017–2026

0

Authors

81

  1. JD
    J. Duato

    Universitat Politècnica de València, Spain

    5 publications · 356 citations

    5

    h-index

  2. MO
    M. Ould‐Khaoua

    University of Glasgow, United Kingdom

    4 publications · 253 citations

    4

    h-index

  3. TM
    Timothy M. Pinkston

    University of Southern California, United States

    4 publications · 333 citations

    4

    h-index

  4. RV
    Rajendra V. Boppana

    The University of Texas at San Antonio, United States

    4 publications · 269 citations

    4

    h-index

  5. HS
    Hamid Sarbazi‐Azad

    Sharif University of Technology, Iran

    3 publications · 127 citations

    3

    h-index

1–5 of 81

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 8 publications · 521 citations

    8

    h-index

  2. IEEE Transactions on Computers

    4 publications · 370 citations

    4

    h-index

  3. ACM SIGARCH Computer Architecture News

    3 publications · 123 citations

    3

    h-index

  4. IEEE/ACM Transactions on Networking

    TON · 1 publications · 22 citations

    1

    h-index

  5. Computer Communications

    1 publications · 10 citations

    1

    h-index

1–5