Weighted Fair Queueing is a packet scheduling algorithm that belongs to the class of fair queueing mechanisms, distinguished by its allocation of differential service weights to traffic flows to ensure proportional bandwidth sharing according to assigned priorities.
135
Publications
7K
Citations
322
Authors
153
Institutions
Publications per year
2017–2026
13
Publications
135
WF/sup 2/Q: worst-case fair weighted fair queueing
J.C.R. Bennett, Hui Zhang · 2002 · 1.1K citations
Pawan Goyal, Harrick M. Vin, Haichen Chen · 1996 · 440 citations
Multi-resource fair queueing for packet processing
Ali Ghodsi, Vyas Sekar, Matei Zaharia et al. · 2012 · 184 citations · Full text
1–5 of 135
Authors
322
- SB
7
h-index
- AV
5
h-index
- DS
5
h-index
- MV
4
h-index
- KA
4
h-index
1–5 of 322
Institutions
153
Eindhoven University of Technology
Eindhoven, The Netherlands
6 h-index
8 publications
261 citations
Nokia (United States)
Coppell, United States
5 h-index
6 publications
411 citations
University of California, Berkeley
Berkeley, United States
5 h-index
9 publications
721 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
5 h-index
9 publications
229 citations
University of California, Santa Cruz
Santa Cruz, United States
5 h-index
7 publications
1.2K citations
Columbia University
New York, United States
4 h-index
6 publications
246 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
3 publications
67 citations
National Taiwan University
Taipei, Taiwan
3 h-index
5 publications
138 citations
1–8 of 153
Venues
- IEEE/ACM Transactions on Networking
TON · 9 publications · 1K citations
9
h-index
- International Journal of Communication Systems
3 publications · 153 citations
3
h-index
- Computer Networks
3 publications · 116 citations
3
h-index
- ACM SIGMETRICS Performance Evaluation Review
PER · 2 publications · 70 citations
2
h-index
- TU/e Research Portal
Repository · 2 publications · 42 citations
2
h-index
1–5