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

Authors

1.5K

  1. CQ
    Chunming Qiao

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

    14 publications · 824 citations

    14

    h-index

  2. XC
    Xiaojun Cao

    Georgia State University, United States

    10 publications · 714 citations

    10

    h-index

  3. JP
    Jason P. Jue

    The University of Texas at Dallas, United States

    10 publications · 560 citations

    10

    h-index

  4. EM
    Eytan Modiano

    Massachusetts Institute of Technology, United States

    9 publications · 264 citations

    9

    h-index

  5. DS
    Devavrat Shah

    Massachusetts Institute of Technology, United States

    7 publications · 234 citations

    7

    h-index

1–5 of 1.5K

Venues

  1. IEEE Transactions on Communications

    41 publications · 1.5K citations

    22

    h-index

  2. IEEE/ACM Transactions on Networking

    TON · 31 publications · 2.7K citations

    20

    h-index

  3. IEEE Journal on Selected Areas in Communications

    24 publications · 2.6K citations

    16

    h-index

  4. Journal of Lightwave Technology

    19 publications · 886 citations

    15

    h-index

  5. IEEE Transactions on Computers

    19 publications · 1.2K citations

    15

    h-index

1–5