ON EXPECTED WAITING TIME FOR MULTISERVER BULK QUEUE WITHOUT PASSING

Abstract

This paper deals with M^X/M/C queueing system with bulk arrivals of random size X. Arrivals follow a geometric distribution, that is, a_m = (1 – a) a^m-1,  m = 1, 2, 3, ….,    0 £ a < 1.  The service times are exponentially distributed.  The departing customers are allowed to leave the system in chronological order.  The expressions for mean waiting time for easy and hard customers in the steady-state are derived.  The graphs between expected waiting time and traffic intensity are drawn.  Numerical results and graphs for expected waiting times are also facilitated for some particular cases.