Performance Analysis of a Renewal Input Bulk Service Queue with Accessible and Non-Accessible Batches

Abstract

In this paper, we consider a single-server infinite-(finite-) buffer bulk-service queues. The interarrival and service times are respectively, arbitrarily and exponentially distributed. The customers are served by a single server in accessible or non-accessible batches of maximum size ‘b’ with a minimum threshold value ‘a’. We provide a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining interarrival time, to develop the steady-state queue length distributions at prearrival and arbitrary epochs. Finally, some numerical results have been presented.