Analysis of discrete-time queues with batch renewal input and multiple vacations

This paper analyzes a discrete-time multiple vacations finite-buffer queueing system with batch renewal input in which inter-arrival time of batches are arbitrarily distributed. Service and vacation times are mutually independent and geometrically distributed. The server takes vacations when the system does not have any waiting jobs at a service completion epoch or a vacation completion epoch. The system is analyzed under the assumptions of late arrival system with delayed access and early arrival system. Using the supplementary variable and the imbedded Markov chain techniques, the authors obtain the queue-length distributions at pre-arrival, arbitrary and outside observer??s observation epochs for partial-batch rejection policy. The blocking probability of the first-, an arbitraryand the last-job in a batch have been discussed. The analysis of actual waiting-time distributions measured in slots of the first-, an arbitrary- and the last-job in an accepted batch, and other performance measures along with some numerical results have also been investigated.