Stability of retrial queues with versatile retrial policy (Q871361)

The paper investigates the problem of stability condition for some retrial queueing models. The first model is a retrial queue with a versatile retrial policy. Consider a single server queue in which a primary arriving customer who finds the server busy moves to a group of blocked customers called ``orbit'' and repeatedly retries for service until he finds the server free, and consider the following retrial policy for the access to the server from the orbit. The probability of a repeated attempt from the orbit during the interval \(t,t + \Delta t\), given that \(j\) customers were in orbit at time \(t\), is \((\theta (1 - \delta _{0j} ) + j\mu )\Delta t + o(\Delta t)\). If a primary arriving customer finds the server free, he receives service and leaves the system. The second model is a retrial queue with two types of arriving customers, known as ``impatient'' and ``persistent''. If an impatient customer finds the server busy, then it leaves the system. On the other hand, if a persistent customer arrives and finds the server busy, then he may have access to the orbit and waits to be served later according to the versatile retrial policy described above. Section 2 gives some backgrounds for stochastic recursive sequence theory and reviews the main theorem that enables the authors to obtain a strong coupling convergence to a stationary regime by using renovation events for the retrial queues described above. In Section 3, the authors apply the method of stochastic recursive sequences to the retrial queue with the versatile retrial policy and derive a sufficient stability condition under general assumption of stationary and ergodic service times, exponentially distributed interarrival and retrial times. In Section 4, they derive a sufficient stability condition for the retrial queues with two types of customers under general stationary ergodic service times for both types, and exponentially distributed interarrival and retrial times. Section 5 considers retrial queues with breakdowns and repairs. Section 6 considers retrial queues with negative customers. Section 7 considers retrial queues with the versatile retrial policy in which customers arrive in batches.