Departure processes of BMAP/G/1 queues (Q5950917)

The paper deals with the departure process of the FIFO \(\text{BMAP/G}/1/K\) queueing system, where BMAP stands for the batch Markovian arrival process and \(K\) for the buffer capacity, which may be infinite, too. In case of a limited buffer capacity the partial batch acceptance policy is adopted if the buffer overflows due to a batch arrival. For the server two cases are considered: (a) the standard vacationless model and (b) the exhaustive service with multiple vacations, i.e. vacations begin when the system becomes idle and the server may take a repeated number of vacations if on its return from vacation an empty system is seen again. Using a unified approach a matrix representation for the lag \(n\) covariance and for the \(z\)-transform of the scaled autocovariance function of the sequence of inter-departure times are derived. The results provide algorithms for computing characteristics for the departure stream, in particular for the moments of the inter-departure times. Various numerical results for different service time distributions are presented and discussed.