Deterministic Routing
Deterministic Routing is a routing algorithm that belongs to the class of routing strategies in interconnect fabrics, distinguished by its property of always selecting the same fixed path between a given source and destination under identical network conditions, thereby ensuring predictable communication behavior.
133
Publications
7.4K
Citations
301
Authors
151
Institutions
Publications per year
2017–2026
19
133
1–5 of 133
301
9
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 301
151
Universitat Politècnica de València
Valencia, Spain
10 h-index
29 publications
1.8K citations

Sharif University of Technology
Tehran, Iran
6 h-index
14 publications
470 citations

Keio University
Tokyo, Japan
5 h-index
14 publications
276 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
5 publications
445 citations
IBM (United States)
Armonk, United States
3 h-index
3 publications
169 citations
Technion – Israel Institute of Technology
Haifa, Israel
3 h-index
3 publications
106 citations
Huawei Technologies (China)
Shenzhen, China
3 h-index
5 publications
294 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
3 h-index
3 publications
162 citations
1–8 of 151
TPDS · 8 publications · 639 citations
8
h-index
6 publications · 723 citations
6
h-index
JACM · 3 publications · 198 citations
3
h-index
2 publications · 39 citations
2
h-index
2 publications · 57 citations
2
h-index
1–5