Scheduling In Queueing Networks
Scheduling in Queueing Networks is a systematic policy or algorithm that determines the order and timing of job service at network nodes to optimize performance metrics such as throughput, delay, or resource utilization within a stochastic network of interconnected queues.
326
Publications
20.8K
Citations
612
Authors
269
Institutions
Publications per year
2017–2026
29
Variants
Queueing Network Scheduling
Parents
326
James R. Jackson · Operations Research · 1957 · 1.3K citations
Scheduling of networked control systems
Greg Walsh, Hong Ye · IEEE Control Systems · 2001 · 815 citations
Efficient fair queueing using deficit round robin
M. Shreedhar, George Varghese · 1995 · 541 citations · Full text
1–5 of 326
612
11
h-index
9
h-index
8
h-index
8
h-index
6
h-index
1–5 of 612
269
Massachusetts Institute of Technology
Cambridge, United States
21 h-index
51 publications
3.4K citations
University of Michigan
Ann Arbor, United States
14 h-index
26 publications
1.1K citations
Columbia University
New York, United States
13 h-index
23 publications
956 citations
University of Maryland, College Park
College Park, United States
12 h-index
15 publications
5.6K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
12 h-index
19 publications
835 citations
University of Illinois Urbana-Champaign
Urbana, United States
12 h-index
28 publications
1.6K citations
University of Southern California
Los Angeles, United States
10 h-index
14 publications
641 citations
University of California, Berkeley
Berkeley, United States
10 h-index
17 publications
1.4K citations
1–8 of 269
16 publications · 2.7K citations
15
h-index
TON · 17 publications · 917 citations
13
h-index
12 publications · 3.6K citations
11
h-index
PER · 10 publications · 196 citations
10
h-index
9 publications · 474 citations
9
h-index
1–5