ACM SIGMETRICS Performance Evaluation Review · 2003 · 47 citations · 6 references
BusinessComputer ScienceComputer NetworksQueuing TheorySchedulingNetworks Of QueuesQueue Length DistributionsQueueing AnalysisQueueing NetworksQueueing SystemsQueueing TheoryG/m/1 QueuesM/g/1 QueuesM/g/c QueueMean Sojourn TimeQueueing Theory OptimizationQueueing-based SchedulingScheduling In Queueing NetworksStochastic Network Flows
We introduce a novel method to prove that the FBPS discipline has optimal mean sojourn time and mean slowdown ratio for DHR service time distributions in an M/G/1 queue. We then discuss the problems related to FBPS, and propose a new scheduling discipline to overcome these problems.
6
Nikhil Bansal, Mor Harchol‐Balter · 2001 · 315 citations
Scheduling flows with unknown sizes
Liang Guo, Ibrahim Matta · 2002 · 32 citations