Minimal Routing

Minimal Routing is a routing algorithm that belongs to the class of path-selection strategies in network communication, distinguished by its principle of forwarding packets along the shortest possible path in terms of hop count or geometric distance between source and destination nodes, particularly within regular topologies such as mesh or torus networks.

58

Publications

2.5K

Citations

141

Authors

68

Institutions

Publications per year

2017–2026

5

Authors

141

  1. JD
    J. Duato

    Universitat Politècnica de València, Spain

    6 publications · 367 citations

    6

    h-index

  2. PL
    Pedro López

    Universitat Politècnica de València, Spain

    4 publications · 119 citations

    4

    h-index

  3. AR
    Antonio Robles

    Universitat Politècnica de València, Spain

    4 publications · 119 citations

    4

    h-index

  4. JF
    José Flich

    Universitat Politècnica de València, Spain

    4 publications · 119 citations

    4

    h-index

  5. JP
    Juha Plosila

    University of Turku, Finland

    3 publications · 110 citations

    3

    h-index

1–5 of 141

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 5 publications · 371 citations

    5

    h-index

  2. IEEE Transactions on Computers

    3 publications · 114 citations

    3

    h-index

  3. IEEE Computer Architecture Letters

    2 publications · 57 citations

    2

    h-index

  4. IEEE Transactions on Reliability

    2 publications · 49 citations

    2

    h-index

  5. ACM SIGARCH Computer Architecture News

    2 publications · 264 citations

    2

    h-index

1–5