Analysis of Markov multiserver retrial queues with negative arrivals (Q5950919): Difference between revisions

The paper considers multiserver retrial queues with Poisson arrivals and exponentially distributed service times. Customers entering this system when all severs are busy join the retrial group and try to enter the system later. The access from the retrial group to the service facility is governed by the linear retrial policy: the probability of a repeated attempt during the interval \((t, t+s)\), given that \(j>0\) customers were in the retrial group at time \(t\), is \((\alpha+ j\mu)s+ o(s)\). In addition, whenever the service facility is completely occupied, an exponential timer is activated. If the timer expires and the service facility remains full, then a random batch of customers at the retrial pool are removed. The authors introduce the process \(((C(t), N(t))\), where \(C(t)\) is the number of busy servers and \(N(t)\) is the number of customers in the retrial group. A particular attention is devoted to the investigation of its positive recurrence. In the overloading case, an averaging principle is established.