Switching Algorithm Design
Switching Algorithm Design is the systematic development of algorithmic methods that determine the establishment, maintenance, and termination of dedicated communication paths in a circuit-switched network, distinguished by its focus on optimizing resource allocation, connection latency, and network throughput within the constraints of fixed channel assignment.
394
Publications
16.2K
Citations
1K
Authors
437
Institutions
Publications per year
2017–2026
56
Parents
394
The throughput of data switches with and without speedup
J. G. Dai, Balaji Prabhakar · 2002 · 471 citations
Abraham Waksman · Journal of the ACM · 1968 · 444 citations · Full text
1–5 of 394
1K
University at Buffalo, State University of New York, United States
6 publications · 458 citations
6
h-index
6
h-index
5
h-index
5
h-index
5
h-index
1–5 of 1K
437
Stanford University
Stanford, United States
12 h-index
29 publications
2.8K citations
University of Illinois Urbana-Champaign
Urbana, United States
9 h-index
17 publications
305 citations
University at Buffalo, State University of New York
Buffalo, United States
9 h-index
21 publications
1.9K citations
The University of Texas at Dallas
Richardson, United States
9 h-index
23 publications
1.1K citations

Poznań University of Technology
Poznan, Poland
8 h-index
16 publications
249 citations
New York University
New York, United States
8 h-index
18 publications
1.8K citations

SUNY Polytechnic Institute
Utica, United States
8 h-index
15 publications
457 citations
Georgia Institute of Technology
Atlanta, United States
7 h-index
12 publications
955 citations
1–8 of 437
17 publications · 1.4K citations
15
h-index
15 publications · 378 citations
12
h-index
12 publications · 263 citations
11
h-index
TON · 10 publications · 365 citations
10
h-index
9 publications · 676 citations
9
h-index
1–5