Abstract
Single server M/G/1-queues with an infinite buffer are studied; these permit inclusion of server vacations and setup times. A service discipline determines the numbers of customers served in one cycle, that is, the time span between two vacation endings. Six service disciplines are investigated: the gated, limited, binomial, exhaustive, decrementing, and Bernoulli service disciplines. The performance of the system depends on three essential measures: the customer waiting time, the queue length, and the cycle duration. For each of the six service disciplines the distribution as well as the first and second moment of these three performance measures are computed. The results permit a detailed discussion of how the expected value of the performance measures depends on the arrival rate, the customer service time, the vacation time, and the setup time. Moreover, the six service disciplines are compared with respect to the first moments of the performance measures.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. Bischof, Analyse von M/G/1–Warteschlangen mit Bedienpausen und Bereitstellungszeiten unter sechs verschiedenen Bediendisziplinen (Wißner–Verlag, Augsburg, 2000).
R.B. Cooper, Introduction to Queueing Theory, 2nd ed. (North–Holland, Amsterdam, 1981).
M.J. Ferguson, Mean waiting time for a token ring with station dependent overheads, in: Local Area and Multiple Access Networks (Computer Science Press, 1986) pp. 43–67.
C. Fricker and M.R. Jaïbi, Monotonicity and stability of polling models, Queueing Systems 15 (1994) 211–238.
S.W. Fuhrmann and R.B. Cooper, Stochastic decompositions in the M/G/1 queue with generalized vacations, Operations Research 33 (1985) 1117–1129.
D. Gupta and M.M. Srinivasan, Polling systems with state–dependent setup times, Queueing Systems 22 (1996) 403–423.
J. Keilson and L.D. Servi, Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules, Applied Probability 23 (1986) 790–802.
L. Kleinrock, Queueing Systems, Vol. I (Wiley, New York, 1975).
H. Levy, Analysis of cyclic–polling systems with binomial–gated service, in: Performance of Distributed and Parallel Systems, eds. Hasegawa, H. Takagi and Y. Takahashi (North–Holland, Amsterdam, 1989) pp. 127–139.
H. Levy, M. Sidi and O.J. Boxma, Dominance relations in polling systems, Queueing Systems 6 (1990) 155–172.
J.D.C. Little, A proof of the queueing formula L = γW, Operations Research 9 (1961) 383–387.
S.I. Resnick, Adventures in Stochastic Processes (Birkhäuser, Boston, 1992).
L.D. Servi, Average delay approximation of M/G/1 cyclic service queues with Bernoulli schedules, IEEE Journal on Selected Areas in Communications SAC–4 6 (1986) 813–822.
D. Stoyan, Comparison Methods for Queues and Other Stochastic Models (Wiley, New York, 1983).
S. Sumita, Performance analysis of interprocessor communications in an electronic switching system with distributed control, Performance Evaluation 9(2) (1989) 83–91.
H. Takagi, Analysis of Polling Systems (MIT, Cambridge, MS, 1986).
H. Takagi, Queueing Analysis, Vol. 1 (North–Holland, Amsterdam, 1991).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bischof, W. Analysis of M/G/1-Queues with Setup Times and Vacations under Six Different Service Disciplines. Queueing Systems 39, 265–301 (2001). https://doi.org/10.1023/A:1013992708103
Issue Date:
DOI: https://doi.org/10.1023/A:1013992708103