Analyzing discrete-time bulk-service Geo/Geob/m queue
Department of Computer Science, Kalinga Institute
of Industrial Technology, Bhubaneswar-751024, India; firstname.lastname@example.org
2 Department of Mathematics, Indian Institute of Technology, Kharagpur-721302, India; email@example.com; firstname.lastname@example.org
Accepted: 5 May 2006
This paper analyzes a discrete-time multi-server queue in which service capacity of each server is a minimum of one and a maximum of b customers. The interarrival- and service-times are assumed to be independent and geometrically distributed. The queue is analyzed under the assumptions of early arrival system and late arrival system with delayed access. Besides, obtaining state probabilities at arbitrary and outside observer's observation epochs, some performance measures and waiting-time distribution in the queue have also been discussed. Finally, it is shown that in limiting case the results obtained in this paper tend to the continuous-time counterpart.
Key words: Bulk-service / discrete-time / multi-server / queueing / waiting-time.
© EDP Sciences, 2006