The bulk input M[X] /M/1 queue with working vacations
Xiu-li Xu , Ming-xin Liu , Xiao-hua Zhao
Journal of Systems Science and Systems Engineering ›› 2009, Vol. 18 ›› Issue (3) : 358 -368.
The bulk input M[X] /M/1 queue with working vacations
In this paper, we analyze a bulk input M[X] /M/1 queue with multiple working vacations. A quasi upper triangle transition probability matrix of two-dimensional Markov chain in this model is obtained, and with the matrix analysis method, highly complicated probability generating function(PGF) of the stationary queue length is firstly derived, from which we got the stochastic decomposition result for the stationary queue length which indicates the evident relationship with that of the classical M[X] /M/1 queue without vacation. It is important that we find the upper and the lower bounds of the stationary waiting time in the Laplace transform order using the properties of the conditional Erlang distribution. Furthermore, we gain the mean queue length and the upper and the lower bounds of the mean waiting time.
M[X] /M/1 queue / bulk input / multiple working vacations / stochastic decomposition / the Laplace transform order
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
Kim, J., Choi, D. & Chae, K. (2003). Analysis of queue-length distribution of the M/G/1 queue with working vacations. In: International Conference on Statistics and Related Fields, Hawaii |
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
/
| 〈 |
|
〉 |