The Gated-Service M/GI/1 Queue with Single Vacations and Its Application to Batch-Service Queues
Pith reviewed 2026-05-10 16:26 UTC · model grok-4.3
The pith
Gated-service M/GI/1 queues with single vacations have explicit transforms for queue length, delay, and busy cycles.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We consider the M/GI/1 queue with single vacations under the gated service discipline. We obtain the probability generating function of the stationary queue length, the Laplace-Stieltjes transform of the system delay distribution in steady state, and the joint transform of the busy cycle length and the number of customers served in the busy cycle. Furthermore, as an application, we consider a batch-service M/G/1 queue, where service times depend on the number of customers in batch.
What carries the argument
Gated service discipline with single vacations in the M/GI/1 model, used to derive the stated transforms for queue length and delay.
Load-bearing premise
Arrivals are Poisson, service times are independent and general, and the system operates under the gated rule that serves only those present when service begins.
What would settle it
Invert the derived probability generating function numerically for exponential services and compare the resulting queue length probabilities to those obtained from direct simulation of the same system.
read the original abstract
In this paper, we consider the M/GI/1 queue with single vacations under the gated service discipline. We obtain the probability generating function of the stationary queue length, the Laplace-Stieltjes transform of the system delay distribution in steady state, and the joint transform of the busy cycle length and the number of customers served in the busy cycle. Furthermore, as an application, we consider a batch-service M/G/1 queue, where service times depend on the number of customers in batch.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript analyzes the M/GI/1 queue with gated service and single vacations. It derives the probability generating function of the stationary queue length, the Laplace-Stieltjes transform of the steady-state system delay, and the joint transform of the busy-cycle length and the number of customers served in the cycle. These results are then applied to a batch-service M/G/1 queue in which the service-time distribution is parameterized by batch size.
Significance. If the derivations hold, the paper supplies explicit transform expressions for performance measures in a standard vacation-queue variant that appears in polling and manufacturing models. The batch-service extension preserves the embedded-Markov-chain structure at service-initiation epochs and therefore inherits the same transforms, offering a compact way to handle size-dependent service times. The approach relies on classical supplementary-variable and embedded-chain techniques rather than new methodology, but the explicit forms remain useful for numerical inversion or moment calculations.
minor comments (3)
- The abstract and introduction should explicitly reference the foundational works on gated vacation queues (e.g., the single-vacation M/G/1 analyses of Doshi or Takagi) to clarify the incremental contribution.
- Notation for the gated service indicator and the vacation residual time should be introduced once in §2 and used consistently; several later equations repeat the conditioning on the number present at service start without cross-reference.
- The batch-service application in §5 would benefit from a short numerical example comparing the derived PGF against simulation for a specific batch-size-dependent service distribution (e.g., deterministic service linear in batch size).
Simulated Author's Rebuttal
We thank the referee for the positive assessment of our work on the gated-service M/GI/1 queue with single vacations and its application to batch-service queues. The recommendation for minor revision is noted. No specific major comments appear in the report.
Circularity Check
No significant circularity
full rationale
The paper derives the PGF of stationary queue length, LST of system delay, and joint transform of busy cycle length and customers served using standard embedded Markov chain analysis at service initiation epochs combined with supplementary variable techniques for the idle period under gated service and single vacations. These steps start from the Poisson arrival process, i.i.d. general service times, and the gated rule (serving only customers present at service start), without any self-definitional loops, fitted parameters renamed as predictions, or load-bearing self-citations that reduce the central claims to unverified inputs. The batch-service application simply allows the service-time distribution to depend on batch size while retaining the identical embedded chain structure, preserving self-contained derivations independent of the target results.
Axiom & Free-Parameter Ledger
axioms (4)
- domain assumption Arrivals follow a Poisson process with rate lambda
- domain assumption Service times are i.i.d. with general distribution
- domain assumption Vacations occur singly and are independent of arrivals
- domain assumption Gated service: only customers found upon server return are served
Reference graph
Works this paper leans on
-
[1]
K. B. Athreya and P.E. Ney, Branching Processes, Springer-Verlag, New York, NY, 1972
work page 1972
-
[2]
Stochastic decompositions in the M/G/1 queue with generalized vacations,
S. W. Fuhrmann and R. B. Cooper, “Stochastic decompositions in the M/G/1 queue with generalized vacations,” Operations Research, vol.33, 1117–1129, 1985
work page 1985
-
[3]
Y. Inoue, “Queueing analysis of GPU-based inference servers with dynamic batching: A closed-form char- acterization,” Performance Evaluation, vol.147, 102183, 2021
work page 2021
-
[4]
A distributional form of Little’s law,
J. Keilson and L. D. Servi, “A distributional form of Little’s law,” Operations Research Letters, vol.7 pp.223–227, 1988
work page 1988
-
[5]
Takagi, Queueing Analysis, A Foundation of Performance Evaluation, Vol
H. Takagi, Queueing Analysis, A Foundation of Performance Evaluation, Vol. 1. Horth-Holland, Amsterdam, The Netherlands, 1991
work page 1991
-
[6]
On the M/G/1 queue with multiple vacations and gated service discipline,
T. Takine and T. Hasegawa, “On the M/G/1 queue with multiple vacations and gated service discipline,” Journal of the Operations Research Society of Japan, vol.35, pp.217–235, 1992
work page 1992
-
[7]
N. Tian and Z. G. Zhang, Vacation Queueing Models, Theory and Applications. Springer, New York, NY, 2006
work page 2006
-
[8]
Performance analysis of the BMAP/G/1 queue with gated servicing and adaptive vacations,
V. M. Vishnevsky, A. N. Dudin, O. V. Semenova, V. I. Klimenok, “Performance analysis of the BMAP/G/1 queue with gated servicing and adaptive vacations,” Performance Evaluation, vol.68, pp.446–462, 2011. 12
work page 2011
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.