The analysis of a discrete time finite-buffer queue with working vacations under Markovian arrival process and PH-service time

Abstract

In this paper, we study the discrete-time MAP/PH/1 queue with multiple working vacations and finite bufferN. Using the Matrix-Geometric Combination method, we obtain the stationary probability vectors of this model, which can be expressed as a linear combination of two matrix-geometric vectors. Furthermore, we obtain some performance measures including the loss probability and give the limit of loss probability as finite bufferNgoes to infinite. Waiting time distribution is derived by using the absorbing Markov chain. Moreover, we obtain the number of customers served in the busy period. At last, some numerical examples are presented to verify the results we obtained and show the impact of parameterNon performance measures.