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
Variants
Minimal Path Routing
58
Adaptive bubble router: a design to improve performance in torus networks
Valentín Puente, R. Beivide, J.A. Gregorio et al. · 2003 · 108 citations
1–5 of 58
141
6
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 141
68
Universitat Politècnica de València
Valencia, Spain
6 h-index
20 publications
780 citations

Universidad de Cantabria
Santander, Spain
4 h-index
17 publications
1.3K citations

University of Turku
Turku, Finland
3 h-index
13 publications
446 citations
Florida Atlantic University
Boca Raton, United States
3 h-index
3 publications
98 citations

Montclair State University
Montclair, United States
3 h-index
3 publications
81 citations
University of California San Diego
San Diego, United States
3 h-index
6 publications
256 citations
Simula Research Laboratory
Oslo, Norway
3 h-index
7 publications
159 citations
Information Technology University
Lahore, Pakistan
3 h-index
13 publications
446 citations
1–8 of 68
TPDS · 5 publications · 371 citations
5
h-index
3 publications · 114 citations
3
h-index
2 publications · 57 citations
2
h-index
2 publications · 49 citations
2
h-index
2 publications · 264 citations
2
h-index
1–5