Blocking probability, throughput and waiting time in finite capacity polling systems

The exact description of the behavior of a queue is given for polling systems with finite capacity buffers, Poisson arrivals, and general independent service and switching times for exhaustive, gated and limited service disciplines. In each case the queue under study is modelled as a queue with server vacation. A previous analysis by H. Takagi, based on this model, implicitly uses the assumption that the busy period and the vacation time are independent. The contribution of this work lies in the elimination of this assumption.