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
36
Flattened Butterfly Topology for On-Chip Networks
John Kim, James Balfour, William J. Dally · 2007 · 220 citations
On-the-Fly Adaptive Routing in High-Radix Hierarchical Networks
Marina García, Enrique Vallejo, Ramón Beivide et al. · 2012 · 77 citations
1–5 of 36
96
Korea Advanced Institute of Science and Technology, South Korea
4 publications · 338 citations
4
h-index
4
h-index
3
h-index
3
h-index
2
h-index
1–5 of 96
53
Stanford University
Stanford, United States
5 h-index
13 publications
1.1K citations
Universitat Politècnica de València
Valencia, Spain
3 h-index
5 publications
418 citations
Digital Wave (United States)
Centennial, United States
2 h-index
3 publications
39 citations
Google (United States)
Mountain View, United States
2 h-index
1 publications
16 citations

University of Turku
Turku, Finland
2 h-index
9 publications
321 citations
Florida Atlantic University
Boca Raton, United States
2 h-index
2 publications
43 citations
IBM Research - Zurich
Rüschlikon, Switzerland
2 h-index
4 publications
196 citations

West Chester University
West Chester, United States
2 h-index
2 publications
43 citations
1–8 of 53
2 publications · 104 citations
2
h-index
TPDS · 2 publications · 212 citations
2
h-index
1 publications · 23 citations
1
h-index
Conference · 1 publications · 13 citations
1
h-index
ICCAD · 1 publications · 48 citations
1
h-index
1–5