Non-minimal Routing

Non-Minimal Routing is a routing strategy in mesh networks where packets are deliberately forwarded along paths that are not the shortest in terms of hop count, in order to alleviate congestion, balance load, or avoid faulty nodes, thereby differing from minimal routing by intentionally introducing path elongation for improved network performance.

36

Publications

1.4K

Citations

96

Authors

53

Institutions

Publications per year

2017–2026

9

Authors

96

  1. JK
    John Kim

    Korea Advanced Institute of Science and Technology, South Korea

    4 publications · 338 citations

    4

    h-index

  2. WJ
    William J. Dally

    Stanford University, United States

    4 publications · 354 citations

    4

    h-index

  3. JB
    James Balfour

    Stanford University, United States

    3 publications · 322 citations

    3

    h-index

  4. JD
    J. Duato

    Universitat Politècnica de València, Spain

    3 publications · 279 citations

    3

    h-index

  5. KB
    Keren Bergman

    Columbia University, United States

    2 publications · 101 citations

    2

    h-index

1–5 of 96

Venues

  1. IEEE Computer Architecture Letters

    2 publications · 104 citations

    2

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 212 citations

    2

    h-index

  3. IEEE Transactions on Reliability

    1 publications · 23 citations

    1

    h-index

  4. Design Automation Conference

    Conference · 1 publications · 13 citations

    1

    h-index

  5. 1

    h-index

1–5