Applied Mathematics Colloquium

Abstract:  In this talk, we will introduce a many-server retrial queueing system with nonpersistent (impatient) customers. Under some mild assumptions on the arrival, service and inter-attempt time distributions, as both the arrival rate and the number of servers go to infinity, a law of large numbers (or fluid) limit result is established for the retrial queue with the aid of the one-dimensional Skorokhod map and a contraction map.  In addition, the set of invariant states for the fluid model 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.