Processor-sharing queues: some progress in analysis
Queueing Systems: Theory and Applications
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Improving the performance of interactive TCP applications using service differentiation
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
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
Classifying scheduling policies with respect to unfairness in an M/GI/1
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Mixed scheduling disciplines for network flows
ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)
A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues
Operations Research Letters
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
Packet-level traffic measurements from the Sprint IP backbone
IEEE Network: The Magazine of Global Internetworking
Batch Arrival Processor-Sharing with Application to Multi-Level Processor-Sharing Scheduling
Queueing Systems: Theory and Applications
Stability of size-based scheduling disciplines in resource-sharing networks
Performance Evaluation - Performance 2005
ACM SIGMETRICS Performance Evaluation Review
PBS: a unified priority-based scheduler
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The Foreground-Background queue: A survey
Performance Evaluation
Optimal scheduling of jobs with a DHR tail in the M/G/1 queue
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
M/G/1/MLPS compared to M/G/1/PS
Operations Research Letters
| Hi-index | 0.00 |
Inspired by several recent papers that focus on scheduling disciplines for network flows, we present a mean delay analysis of Multilevel Processor Sharing (MLPS) scheduling disciplines in the context of M/G/1 queues. Such disciplines have been proposed to model the effect of the differentiation between short and long TCP flows in the Internet. Under MLPS, jobs are classified into classes depending on their attained service. We consider scheduling disciplines where jobs within the same class are served either with Processor Sharing (PS) or Foreground Background (FB) policy, and the class that contains jobs with the smallest attained service is served first. It is known that the FB policy minimizes (maximizes) the mean delay when the hazard rate of the job size distribution is decreasing (increasing). Our analysis, based on pathwise and meanwise arguments of the unfinished truncated work, shows that Two-Level Processor Sharing (TLPS) disciplines, e.g., FB+PS and PS+PS, are better than PS scheduling when the hazard rate of the job size distribution is decreasing. If the hazard rate is increasing and bounded, we show that PS outperforms PS+PS and FB+PS. We further extend our analysis to study local optimality within a level of an MLPS scheduling discipline.