Some Features of a Finite-Source M/GI/1 Retrial Queuing System with Collisions of Customers

In this paper a nite-source M/GI/1 retrial queuing system with collisions of customers is considered. The de nition of throughput of the system as average number of customers, which are successfully served per unit time is introduced. It is shown that at some combinations of system parameter values and probability distribution of service time of customers the throughput can be arbitrarily small, and at another values of parameters throughput can be greater than the service intensity. It is also demonstrated that there are such values of the system parameters at which probability distribution of number of customers in system is bimodal. That is, for a random process of changing in time the number of customers there are two points of stabilization and the random process alternates from the neighborhood of one stabilization point to the neighborhood of another one and back.