Congestion-aware Scheduling
Congestion-Aware Scheduling is a communication scheduling method that strategically allocates transmission resources by dynamically considering network congestion levels to optimize data flow efficiency and minimize latency.
348
Publications
14.3K
Citations
1K
Authors
452
Institutions
Publications per year
2017–2026
104
Parents
348
Experimental evaluation of multipath TCP schedulers
Christoph Paasch, Simone Ferlin, Özgü Alay et al. · 2014 · 309 citations · Full text
Maxmin fair scheduling in wireless networks
Leandros Tassiulas, Sunetra Sarkar · 2003 · 291 citations
1–5 of 348
1K
6
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 1K
452
Stanford University
Stanford, United States
9 h-index
23 publications
1.1K citations
Tsinghua University
Beijing, China
7 h-index
17 publications
506 citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
11 publications
680 citations
University of Maryland, College Park
College Park, United States
7 h-index
9 publications
535 citations
University of Southern California
Los Angeles, United States
6 h-index
11 publications
404 citations
COMSATS University Islamabad
Islamabad, Pakistan
6 h-index
13 publications
361 citations
Nanyang Technological University
Singapore, Singapore
6 h-index
10 publications
280 citations
University of Pennsylvania
Philadelphia, United States
5 h-index
8 publications
466 citations
1–8 of 452
19 publications · 600 citations
14
h-index
16 publications · 361 citations
14
h-index
11 publications · 297 citations
11
h-index
MONET · 7 publications · 246 citations
7
h-index
JNCA · 6 publications · 362 citations
6
h-index
1–5