An All Geometric Discrete-Time Multiserver Queueing System

Abstract

AbstractIn this work we look at a discrete-time multiserver queueing system where the number of available servers is distributed according to one of two geometrics. The arrival process is assumed to be general independent, the service times deterministically equal to one slot and the buffer capacity infinite. The queueing system resides in one of two states and the number of available servers follows a geometric distribution with parameter determined by the system state. At the end of a slot there is a fixed probability that the system evolves from one state to the other, with this probability depending on the current system state only, resulting in geometrically distributed sojourn times.We obtain the probability generating function (pgf) of the system content of an arbitrary slot in steady-state, as well as the pgf of the system content at the beginning of an arbitrary slot with a given state. Furthermore we obtain an approximation of the distribution of the delay a customer experiences in the proposed queueing system. This approximation is validated by simulation and the results are illustrated with a numerical example.KeywordsQueueing theoryDiscrete-timeMultiserverGeometricSystem contentDelay