Processor-sharing queues: some progress in analysis
Queueing Systems: Theory and Applications
Self-similarity in World Wide Web traffic: evidence and possible causes
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scheduling flows with unknown sizes: approximate analysis
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Asymptotic convergence of scheduling policies with respect to slowdown
Performance Evaluation
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
Fitting Mixtures of Exponentials to Long-Tail Distributions to Analyze Network Performance Models
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
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)
Two-level processor-sharing scheduling disciplines: mean delay analysis
Proceedings of the joint 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
Connection scheduling in web servers
USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
Mean delay optimization for the M/G/1 queue with pareto type service times
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Size-based scheduling to improve the performance of short TCP flows
IEEE Network: The Magazine of Global Internetworking
On the Gittins index in the M/G/1 queue
Queueing Systems: Theory and Applications
A spike-detecting AQM to deal with elephants
Computer Networks: The International Journal of Computer and Telecommunications Networking
QoE-aware optimization of multimedia flow scheduling
Computer Communications
Hi-index | 0.00 |
We consider the mean delay optimization in the M/G/1 queue for jobs with a service time distribution that has a tail with decreasing hazard rate (DHR). If the DHR property is valid for the whole distribution, then it is known that the Foreground-Background (FB) discipline, which gives priority to the job with least amount of attained service, is optimal among nonanticipating scheduling disciplines. However, FB may fail to be optimal if the DHR property is valid only for the tail of the distribution. An important example is the Pareto distribution bounded away from zero. In this paper we show that for a class of service time distributions with a DHR tail (including the Pareto distribution), the optimal nonanticipating discipline is a combination of FCFS and FB disciplines, which gives priority to the jobs with attained service less than some fixed threshold θ*. These priority jobs are served in the FCFS manner. If there are no jobs with attained service less than θ*, priority is given to the job with least amount of attained service.