Processor-sharing queues: some progress in analysis
Queueing Systems: Theory and Applications
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
Analysis of LAS scheduling for job size distributions with high variance
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance analysis of LAS-based scheduling disciplines in a packet switched network
Proceedings of the joint international conference on Measurement and modeling of computer systems
Classifying scheduling policies with respect to higher moments of conditional response time
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Spatio-temporal modeling of traffic workload in a campus WLAN
WICON '06 Proceedings of the 2nd annual international workshop on Wireless internet
The Foreground-Background queue: A survey
Performance Evaluation
| Hi-index | 0.00 |
Size-based scheduling has proved to be effective in a lot of scenarios involving Internet traffic. In this work, we focus on the Least Attained Service Policy, a popular size-based scheduling policy. We tackle two issues that have not received much attention so far. Firstly, the variance of the conditional response time. We prove that the classification proposed by Wierman et al. [11], which classifies LAS as an always unpredictable policy, is overly pessimistic. We illustrate the latter by focusing on the M/M/1/LAS queue. Secondly, we consider LAS queues in tandem. We provide preliminary results concerning the characterization of the output process of an M/M/1/LAS queue and the conditional average response time of LAS queues in tandem.