Discrete-time bulk-service queues with accessible and non-accessible batches

摘要

This paper analyzes a discrete-time single-server infinite- (finite-) buffer bulk-service queues. The inter-arrival times of successive arrivals are assumed to be independent and geometrically distributed. The customers are served by a single-server in accessible or non-accessible batches. The service times of batches are also assumed to be independent and geometrically distributed. The steady-state probabilities with computational experiences have been presented.