This paper is concerned with a bulk input Geom/Geom/1 queue with multiple working vacations. Firstly a two-dimensional Markov chain model is established, and with the matrix analysis method, highly complicated PGF of the stationary queue size is derived, from which the stochastic decomposition result for the PGF of the stationary queue size is obtained, which indicates the evident relationship with that of the classical Geom/Geom/1 queue without vacation. The biparameter addition theorems for the conditional negative binomial distribution is established, with which the upper bound and the lower bound of the stationary waiting time is given in the moment generating function order. Furthermore, the mean queue size, the upper bound and the lower bound of the mean waiting time are obtained. Finally, some numerical examples are presented.
XU Xiuli
, LIU Chunping
, CAO Xueyun
, LI Pei. , {{custom_author.name_en}}.
Analysis Based on Discrete Time Bulk Input Queue with Multiple Working Vacations. Journal of Systems Science and Mathematical Sciences, 2010, 30(7): 947-957 https://doi.org/10.12341/jssms09010
PDF(512 KB)
