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

Authors

1K

  1. CQ
    Chunming Qiao

    University at Buffalo, State University of New York, United States

    6 publications · 458 citations

    6

    h-index

  2. DS
    Devavrat Shah

    Massachusetts Institute of Technology, United States

    6 publications · 262 citations

    6

    h-index

  3. RS
    R. Srikant

    University of Illinois Urbana-Champaign, United States

    5 publications · 109 citations

    5

    h-index

  4. BP
    Balaji Prabhakar

    Stanford University, United States

    5 publications · 681 citations

    5

    h-index

  5. EM
    Eytan Modiano

    Massachusetts Institute of Technology, United States

    5 publications · 75 citations

    5

    h-index

1–5 of 1K

Venues

  1. IEEE Journal on Selected Areas in Communications

    17 publications · 1.4K citations

    15

    h-index

  2. IEEE Transactions on Communications

    15 publications · 378 citations

    12

    h-index

  3. Computer Networks

    12 publications · 263 citations

    11

    h-index

  4. IEEE/ACM Transactions on Networking

    TON · 10 publications · 365 citations

    10

    h-index

  5. IEEE Transactions on Computers

    9 publications · 676 citations

    9

    h-index

1–5