On the MX/G/1 retrial queue with Bernoulli schedules and general retrial times

This paper is concerned with the analysis of a single-server batch arrival retrial queue with Bernoulli vacant schedules and general retrial times. We assume that the customers who find the server busy are queued in their orbit in accordance with an FCFS (first-come-first-served) discipline and only the customer at the head of the queue is allowed for access to the server. We first present the necessary and sufficient condition for the system to be stable and derive analytical results for the queue length distribution as well as some performance measures of the system under steady state condition. We show that the general stochastic decomposition law for M^X/G/1 queue with vacation models holds for the present system too. Some special cases are also studied.