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
764
Fair Allocation of Scarce Medical Resources in the Time of Covid-19
Ezekiel Emanuel, Govind Persad, Ross Upshur et al. · New England Journal of Medicine · 2020 · 3.2K citations
Charging and rate control for elastic traffic
F. P. Kelly · European Transactions on Telecommunications · 1997 · 3K citations · Full text
1–5 of 764
1.5K
13
h-index
13
h-index
12
h-index
11
h-index
11
h-index
1–5 of 1.5K
530
University of Illinois Urbana-Champaign
Urbana, United States
22 h-index
59 publications
5.5K citations
Carnegie Mellon University
Pittsburgh, United States
20 h-index
50 publications
7.3K citations
Nokia (United States)
Coppell, United States
17 h-index
31 publications
2.3K citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
15 h-index
36 publications
1.6K citations
Columbia University
New York, United States
12 h-index
17 publications
801 citations
Massachusetts Institute of Technology
Cambridge, United States
12 h-index
23 publications
7K citations
AT&T (United States)
Bedminster, United States
12 h-index
26 publications
1.7K citations
University of Southern California
Los Angeles, United States
12 h-index
24 publications
4K citations
1–8 of 530
TON · 48 publications · 11.7K citations
32
h-index
CCR · 22 publications · 2.1K citations
19
h-index
17 publications · 1.7K citations
14
h-index
15 publications · 301 citations
12
h-index
15 publications · 398 citations
12
h-index
1–5