The effect of service time variability on maximum queue lengths in MX/G/1 queues

DOI10.1239/JAP/1127322037MaRDI QIDQ3367759zbMATH OpenOpenAlexFDO

Authors Ger Koole, Misja Nuyens, Rhonda Righter

Publication date 26 January 2006

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0403318

zbMATH Keywords

busy periodLCFSstochastic ordering

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Abstract: We study the impact of service-time distributions on the distribution of the maximum queue length during a busy period for the M^X/G/1 queue. The maximum queue length is an important random variable to understand when designing the buffer size for finite buffer (M/G/1/n) systems. We show the somewhat surprising result that for three variations of the preemptive LCFS discipline, the maximum queue length during a busy period is smaller when service times are more variable (in the convex sense).

Recommendations

• On the busy-period distributions of M/G/1/K queues by state-dependent arrivals and FCFS/LCFS-P service disciplines
• The maximum queue length for heavy-tailed service times in the M/G/1 FB queue
• Effects of service disciplines in \(G/GI/s\) queueing systems
• Maximum Queue Length and Waiting Time Revisited: Multserver G/G/c Queue
• Invariance relations in single server queues with LCFS service discipline

Cites work

• Comparison of queues with different discrete-time arrival processes
• Complementary generating functions for theM^X/GI/1/kandGI/M^y/1/Kqueues and their application to the comparison of loss probabilities
• scientific article; zbMATH DE number 3656855 (Why is no real title available?)
• Monotonicity of the Loss Probabilities of Single Server Finite Queues with Respect to Convex Order of Arrival or Service Processes
• On an elementary characterization of the increasing convex ordering, by an application
• Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs
• Single-machine scheduling subject to stochastic breakdowns
• Single-machine scheduling with exponential processing times and general stochastic cost functions
• Stochastic convexity for multidimensional processes and its applications
• Stochastic scheduling subject to machine breakdowns: The preemptive-repeat model with discounted reward and other criteria

Cited in

(5)

• The maximum queue length for heavy-tailed service times in the M/G/1 FB queue
• Analysis of the GI/GI/1 Queue and its Variations via the LCFS Preemptive Resume Discipline and Its Random Walk Interpretation
• On the busy-period distributions of M/G/1/K queues by state-dependent arrivals and FCFS/LCFS-P service disciplines
• Server sharing with a limited number of service positions and symmetric queues
• Externalities in the M/G/1 queue: LCFS-PR versus FCFS

This page was built for publication: The effect of service time variability on maximum queue lengths in M^X/G/1 queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3367759)