Queueing-based Scheduling
Queueing-Based Scheduling is a stochastic scheduling framework that allocates resources or prioritizes tasks by modeling job arrivals and service times as queueing processes to optimize performance metrics such as delay, throughput, or fairness.
402
Publications
22.9K
Citations
802
Authors
355
Institutions
Publications per year
2017–2026
43
Parents
402
Achieving 100% throughput in an input-queued switch
Nick McKeown, A. Mekkittikul, V. Anantharam et al. · IEEE Transactions on Communications · 1999 · 855 citations
Fair scheduling in wireless packet networks
Songwu Lu, V. Bharghavan, R. Srikant · IEEE/ACM Transactions on Networking · 1999 · 640 citations
Efficient fair queueing using deficit round robin
M. Shreedhar, George Varghese · 1995 · 541 citations · Full text
1–5 of 402
802
8
h-index
7
h-index
6
h-index
6
h-index
6
h-index
1–5 of 802
355
University of Michigan
Ann Arbor, United States
15 h-index
30 publications
1.2K citations
Massachusetts Institute of Technology
Cambridge, United States
14 h-index
28 publications
1.7K citations
University of California, Berkeley
Berkeley, United States
13 h-index
28 publications
3.6K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
13 h-index
23 publications
1.3K citations
The Ohio State University
Columbus, United States
11 h-index
26 publications
2.4K citations
IBM (United States)
Armonk, United States
10 h-index
16 publications
827 citations
University of Illinois Urbana-Champaign
Urbana, United States
9 h-index
19 publications
3.1K citations

University of Toronto
Toronto, Canada
9 h-index
15 publications
1.3K citations
1–8 of 355
TON · 17 publications · 2.1K citations
15
h-index
15 publications · 2K citations
13
h-index
PER · 11 publications · 419 citations
10
h-index
AAP · 8 publications · 318 citations
8
h-index
8 publications · 688 citations
8
h-index
1–5