Fair Queueing

Fair Queueing is a packet scheduling algorithm that belongs to the class of network traffic management techniques, distinguished by its method of approximating generalized processor sharing to ensure equitable bandwidth allocation among competing flows by isolating users from each other and preventing high-bandwidth users from monopolizing network resources.

764

Publications

65K

Citations

1.5K

Authors

530

Institutions

Publications per year

2017–2026

53

Authors

1.5K

  1. SS
    Scott Shenker

    University of California, Berkeley, United States

    14 publications · 3.3K citations

    13

    h-index

  2. IS
    Ion Stoica

    University of California, Berkeley, United States

    14 publications · 2.1K citations

    13

    h-index

  3. DS
    D. Stiliadis

    University of California, Santa Cruz, United States

    12 publications · 1.7K citations

    12

    h-index

  4. RS
    R. Srikant

    University of Illinois Urbana-Champaign, United States

    11 publications · 1.6K citations

    11

    h-index

  5. SL
    Songwu Lu

    University of California, Los Angeles, United States

    12 publications · 1.7K citations

    11

    h-index

1–5 of 1.5K

Venues

  1. IEEE/ACM Transactions on Networking

    TON · 48 publications · 11.7K citations

    32

    h-index

  2. ACM SIGCOMM Computer Communication Review

    CCR · 22 publications · 2.1K citations

    19

    h-index

  3. IEEE Journal on Selected Areas in Communications

    17 publications · 1.7K citations

    14

    h-index

  4. Computer Communications

    15 publications · 301 citations

    12

    h-index

  5. Computer Networks

    15 publications · 398 citations

    12

    h-index

1–5