Scalable Routing

Scalable Routing is a routing paradigm in computer networks designed to maintain efficient and effective path determination as the network规模 grows, distinguished by its ability to sustain performance and low overhead without requiring fundamental changes to its structure or protocols.

379

Publications

22K

Citations

1K

Authors

349

Institutions

Publications per year

2017–2026

55

Authors

1K

  1. MG
    Mário Gerla

    University of California, Los Angeles, United States

    10 publications · 1.7K citations

    10

    h-index

  2. KF
    Kevin Fall

    Intel (United States), United States

    6 publications · 1.1K citations

    6

    h-index

  3. JG
    J.J. Garcia‐Luna‐Aceves

    University of California, Santa Cruz, United States

    6 publications · 267 citations

    6

    h-index

  4. SR
    Sylvia Ratnasamy

    University of California, Berkeley, United States

    6 publications · 1.4K citations

    6

    h-index

  5. TF
    Thomas Fuhrmann

    Karlsruhe Institute of Technology, Germany

    5 publications · 128 citations

    5

    h-index

1–5 of 1K

Venues

  1. ACM SIGCOMM Computer Communication Review

    CCR · 11 publications · 890 citations

    11

    h-index

  2. IEEE Journal on Selected Areas in Communications

    10 publications · 1.1K citations

    10

    h-index

  3. IEEE/ACM Transactions on Networking

    TON · 8 publications · 390 citations

    8

    h-index

  4. IEEE Access

    5 publications · 453 citations

    5

    h-index

  5. arXiv (Cornell University)

    Repository · 5 publications · 115 citations

    5

    h-index

1–5