Switching Algorithms
Switching Algorithms is a computational method within network switching that determines the optimal path or mechanism for forwarding data packets between network nodes based on predefined criteria such as latency, bandwidth, or congestion.
698
Publications
32K
Citations
1.5K
Authors
559
Institutions
Publications per year
2017–2026
72
Parents
698
1–5 of 698
1.5K
University at Buffalo, State University of New York, United States
14 publications · 824 citations
14
h-index
10
h-index
10
h-index
9
h-index
7
h-index
1–5 of 1.5K
559
Stanford University
Stanford, United States
18 h-index
35 publications
4.2K citations
University at Buffalo, State University of New York
Buffalo, United States
16 h-index
34 publications
2.5K citations
The University of Texas at Dallas
Richardson, United States
14 h-index
26 publications
1.5K citations
Massachusetts Institute of Technology
Cambridge, United States
13 h-index
34 publications
1.5K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
12 h-index
26 publications
1.1K citations
New York University
New York, United States
11 h-index
24 publications
1.9K citations
Universitat Politècnica de Catalunya
Barcelona, Spain
10 h-index
25 publications
591 citations
AT&T (United States)
Bedminster, United States
10 h-index
13 publications
514 citations
1–8 of 559
41 publications · 1.5K citations
22
h-index
TON · 31 publications · 2.7K citations
20
h-index
24 publications · 2.6K citations
16
h-index
19 publications · 886 citations
15
h-index
19 publications · 1.2K citations
15
h-index
1–5