Censoring Technique Applied to a Map/G/1 Queue with Set-up Time and Multiple Vacations

Infinite state Markov chains with block-structured transition matrix find extensive applications in many areas, including telecommunications, and queueing systems, for example. In this paper, we use the censoring technique to study a MAP/G/1 queue with set-up time and multiple vacations, whose transition matrix can be transformed to a block-Toeplitz or block-repeating structured. Hence, we are able to relate the boundary conditions of the system to a Markov chain of M/G/1 type. This leads to a solution of the boundary equations, which is crucial for solving the system of differential equations. We also provide expressions for the distribution of stationary queue length, virtual waiting time and the busy period, respectively.