Deterministic Routing

Deterministic Routing is a routing algorithm that belongs to the class of routing strategies in interconnect fabrics, distinguished by its property of always selecting the same fixed path between a given source and destination under identical network conditions, thereby ensuring predictable communication behavior.

133

Publications

7.4K

Citations

301

Authors

151

Institutions

Publications per year

2017–2026

19

Authors

301

  1. JD
    J. Duato

    Universitat Politècnica de València, Spain

    9 publications · 728 citations

    9

    h-index

  2. MK
    Michihiro Koibuchi

    National Institute of Informatics, Japan

    5 publications · 90 citations

    5

    h-index

  3. HS
    Hamid Sarbazi‐Azad

    Sharif University of Technology, Iran

    5 publications · 140 citations

    5

    h-index

  4. JF
    José Flich

    Universitat Politècnica de València, Spain

    4 publications · 135 citations

    4

    h-index

  5. ME
    Masoumeh Ebrahimi

    University of Turku, Finland

    4 publications · 123 citations

    4

    h-index

1–5 of 301

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 8 publications · 639 citations

    8

    h-index

  2. IEEE Transactions on Computers

    6 publications · 723 citations

    6

    h-index

  3. Journal of the ACM

    JACM · 3 publications · 198 citations

    3

    h-index

  4. 2

    h-index

  5. Journal of Algorithms

    2 publications · 57 citations

    2

    h-index

1–5