Virtual Cut-through Routing
Virtual Cut-Through Routing is a routing algorithm that belongs to the class of store-and-forward routing methods, distinguished by its use of buffer allocation at intermediate nodes only when the next hop is available, thereby reducing latency compared to traditional store-and-forward routing while avoiding the deadlock risks of pure cut-through routing.
44
Publications
3.4K
Citations
121
Authors
47
Institutions
Publications per year
2017–2026
1
Parents
44
Blue Gene/L torus interconnection network
N. R. Adiga, Matthias A. Blumrich, D. Chen et al. · IBM Journal of Research and Development · 2005 · 327 citations
1–5 of 44
121
8
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 121
47
Universitat Politècnica de València
Valencia, Spain
10 h-index
17 publications
770 citations

Universidad de Cantabria
Santander, Spain
6 h-index
16 publications
693 citations
University of Michigan
Ann Arbor, United States
5 h-index
6 publications
161 citations
Pohang University of Science and Technology
Pohang, South Korea
4 h-index
5 publications
193 citations
University of Southern California
Los Angeles, United States
3 h-index
5 publications
228 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
5 publications
142 citations

Pennsylvania State University
State College, United States
2 h-index
2 publications
132 citations
University of California, Los Angeles
Los Angeles, United States
2 h-index
4 publications
2.2K citations
1–8 of 47
TPDS · 8 publications · 491 citations
8
h-index
6 publications · 280 citations
6
h-index
2 publications · 52 citations
2
h-index
Conference · 1 publications · 11 citations
1
h-index
1 publications · 390 citations
1
h-index
1–5