Valiant Routing
Valiant Routing is a routing algorithm that employs a randomized multi-phase forwarding strategy to achieve load balancing in networks by routing packets through intermediate pseudorandom destinations before reaching their final endpoints.
19
Publications
732
Citations
52
Authors
13
Institutions
Publications per year
2017–2026
1
Variants
Valiant's Algorithm
19
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Daeho Seo, Akif Ali, Wontaek Lim et al. · 2005 · 65 citations
Scalable, accurate multicore simulation in the 1000-core era
Mieszko Lis, Pengju Ren, Myong Hyon Cho et al. · 2011 · 62 citations · Full text
Darsim: A Parallel Cycle-Level NoC Simulator
Mieszko Lis, Keun Sup Shim, Myong Hyon Cho et al. · DSpace@MIT (Massachusetts Institute of Technology) · 2010 · 52 citations · Full text
1–5 of 19
52
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 52
13
Stanford University
Stanford, United States
6 h-index
16 publications
448 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
19 publications
939 citations
Princeton University
Princeton, United States
3 h-index
4 publications
136 citations
Purdue University West Lafayette
West Lafayette, United States
3 h-index
11 publications
1.2K citations

Xi'an Jiaotong University
Xi'an, China
2 h-index
2 publications
114 citations

Cornell University
Ithaca, United States
2 h-index
6 publications
128 citations

University of Electronic Science and Technology of China
Chengdu, China
2 h-index
5 publications
50 citations
UCLouvain
Louvain-la-Neuve, Belgium
1 h-index
1 publications
41 citations
1–8 of 13
1 publications · 10 citations
1
h-index
Repository · 1 publications · 41 citations
1
h-index
1 publications · 10 citations
1
h-index
Repository · 1 publications · 52 citations
1
h-index
1 publications · 10 citations
1
h-index
1–5