The impact of the service discipline on delay asymptotics

Authors:
S. C. Borst;O. J. Boxma;R. Núñez-Queija;A. P. Zwart
Affiliations:
CWI, P.O. Box 94079, 1090 GB Amsterdam and Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, Netherlands and Bell Laboratories, M ...;CWI, P.O. Box 94079, 1090 GB Amsterdam and Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, Netherlands;CWI, P.O. Box 94079, 1090 GB Amsterdam, Netherlands and Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, Netherlands
Venue:
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Year:
2003

Citing 18
Cited 25

Processor-sharing queues: some progress in analysis

Queueing Systems: Theory and Applications
How large delays build up in a GI/G/1 quqe

Queueing Systems: Theory and Applications
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)

IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling

IEEE/ACM Transactions on Networking (TON)
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
Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level

IEEE/ACM Transactions on Networking (TON)
The busy period in the fluid queue

SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Tail Asymptotics for the Busy Period in the GI/G/1 Queue

Mathematics of Operations Research
Asymptotics for M/G/1 low-priority waiting-time tail probabilities

Queueing Systems: Theory and Applications
Activity periods of an infinite server queue and performance of certain heavy tailed fluid queues

Queueing Systems: Theory and Applications
Scheduling strategies and long-range dependence

Queueing Systems: Theory and Applications
Sojourn times in a processor sharing queue with service interruptions

Queueing Systems: Theory and Applications
Sojourn time asymptotics in the M/G/1 processor sharing queue

Queueing Systems: Theory and Applications
The Asymptotic Workload Behavior of Two Coupled Queues

Queueing Systems: Theory and Applications
Heavy Tails: The Effect of the Service Discipline

TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows

Queueing Systems: Theory and Applications
The equivalence between processor sharing and service in random order

Operations Research Letters

Sojourn Times In The M/G/1 FB Queue With Light-Tailed Service Times

Probability in the Engineering and Informational Sciences
Large deviations of sojourn times in processor sharing queues

Queueing Systems: Theory and Applications
Sojourn time asymptotics in processor-sharing queues

Queueing Systems: Theory and Applications
Design and evaluation of web proxies by leveraging self-similarity of web traffic

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
Sojourn times in (discrete) time shared systems and their continuous time limits

valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Tail equivalence for some time-shared systems

valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Comparing FB and PS scheduling policies

ACM SIGMETRICS Performance Evaluation Review
On the effect of inexact size information in size based policies

ACM SIGMETRICS Performance Evaluation Review
Fairness and classifications

ACM SIGMETRICS Performance Evaluation Review
Tails in scheduling

ACM SIGMETRICS Performance Evaluation Review
Adaptive and scalable comparison scheduling

Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scheduling in polling systems

Performance Evaluation
Power-law vs exponential queueing in a network traffic model

Performance Evaluation
The Foreground-Background queue: A survey

Performance Evaluation
Asymptotic properties of sojourn times in multiclass time-shared systems

Probability in the Engineering and Informational Sciences
Scheduling despite inexact job-size information

SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Sojourn times in (discrete) time shared systems and their continuous time limits

Queueing Systems: Theory and Applications
CWS: a model-driven scheduling policy for correlated workloads

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Sojourn time tails in the single server queue with heavy-tailed service times

Queueing Systems: Theory and Applications
A weighted-fair-queuing (WFQ)-based dynamic request scheduling approach in a multi-core system

Future Generation Computer Systems
Delay tails in MapReduce scheduling

Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Queue-length asymptotics for generalized max-weight scheduling in the presence of heavy-tailed traffic

IEEE/ACM Transactions on Networking (TON)
Is Tail-Optimal Scheduling Possible?

Operations Research
Tail asymptotics of the waiting time and the busy period for the $${{\varvec{M/G/1/K}}}$$ queues with subexponential service times

Queueing Systems: Theory and Applications
Max-Weight Scheduling in Queueing Networks With Heavy-Tailed Traffic

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper surveys the M/G/1 queue with regularly varying service requirement distribution. It studies the effect of the service discipline on the tail behavior of the waiting-time and/or sojourn-time distribution, demonstrating that different disciplines lead to quite different tail behavior. The orientation of the paper is methodological: We outline four different methods for determining tail behavior, illustrating them for service disciplines like FCFS, Processor Sharing and LCFS.