Fluid limits of many-server retrial queues with nonpersistent customers
This work considers a many-server retrial queueing system in which nonpersistent (impatient) customers with i.i.d., generally distributed service times and independent sequences of i.i.d., generally distributed inter-attempt times. A newly arrived customer attempts to obtain service immediately upon arrival and joins a retrial orbit with probability \(p\in [0,1]\) if all servers are busy, and re-attempts to obtain service after a random amount of time until it gets service. The dynamics of the system is represented in terms of a family of measure-valued processes that keep track of the amounts of time that each customer being served has been in service and the waiting times of customers in the retrial orbit since their previous attempts to obtain service. Under some mild assumptions, as both the arrival rate and the number of servers go to infinity, a law of large numbers (or fluid) limit is established for this family of processes with the aid of the one-dimensional Skorokhod map and a contraction map. The limit is shown to be the unique solution to the so-called (extended) fluid model equations. In addition, the set of invariant states for the (extended) fluid model equations is established and is used to yield some steady state performance measures, such as the steady state blocking probability and the steady state number of customers in the retrial orbit.
fluid limits retrial queues nonpersistent measure-valued processes gi/g/n retrial queue strong law of large numbers primary 60f17 60k25 90b22 secondary 60h99 35d99