Abstract
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.
Similar content being viewed by others
References
Abramov, V.: Analysis of multiserver retrial queueing system: a martingale approach and an algorithm of solution. Ann. Oper. Res. 141, 19–52 (2006)
Artalejo, J.R.: Accessible bibliography on retrial queues: progress in 2000–2009. Math. Comput. Model. 51, 1071–1081 (2010)
Atar, R., Kaspi, H., Shimkin, N.: Fluid limits of many-server systems with reneging under a priority policy. Math. Oper. Res. 39, 672–696 (2014)
Choi, B.D., Kim, J.W.: Discrete-time Geo1, Geo2/G/1 retrial queueing system with two types of calls. Comput. Math. Appl. 33, 79–88 (1997)
Falin, G.: A survey of retrial queues. Queueing Syst. 7, 127–168 (1990)
Falin, G., Templeton, J.G.C.: Retrial Queues. Chapman and Hall, London (1997)
Falin, G.I., Martin Diaz, M., Artalejo, J.R.: Information theoretic approximations for the M/G/1 retrial queue. Acta Informatica 31, 559–571 (1994)
Gromoll, H.C., Puha, A.L., Williams, R.J.: The fluid limit of a heavily loaded processor sharing queue in heavy traffic. Ann. Appl. Probab. 12, 797–859 (2002)
Gromoll, H.C., Robert, P., Zwart, B.: Fluid limits for processor sharing queues with impatience. Math. Oper. Res. 33, 375–402 (2008)
Kang, W., Pang, G.: Fluid limit of a many-server queueing network with abandonment, submitted.
Kang, W., Ramanan, K.: Fluid limits of many-server queues with reneging. Ann. Appl. Probab. 20, 2204–2260 (2011)
Kang, W., Ramanan, K.: Asymptotic approximations for the stationary distributions of many-server queues. Ann. Appl. Probab. 22, 477–521 (2012)
Kaspi, H., Ramanan, K.: Law of large numbers limits for many-server queues. Ann. Appl. Probab. 20, 2204–2260 (2011)
Kaspi, H., Ramanan, K.: SPDE limits of many-server queues. Ann. Appl. Probab. 23, 145–229 (2013)
Keilson, J., Cozzolino, J., Young, H.: A service system with unfilled requests repeated. Oper. Res. 16, 1126–1137 (1968)
Li, H., Yang, T.: Geo/G/1 discrete-time retrial queue with Bernoulli schedule. Eur. J. Oper. Res. 111, 629–649 (1998)
Morozov, E.: A multiserver retrial queue: regenerative stability analysis. Queueing Syst. 56, 157–168 (2007)
Parthasarathy, K.R.: Probability measures on metric spaces. Academic Press, New York (1967)
Author information
Authors and Affiliations
Corresponding author
Appendix A: Proof of Lemma 4
Appendix A: Proof of Lemma 4
Fix \(T\in [0,\infty )\) and a bounded measurable function \(\psi \) on \([0,H^a)\times {\mathbb R}_+\). It follows from the definition of \(w^{(N)}_{ij}\) in Sect. 2.2 that for \(0\le s<t<\infty \), \(m\in {\mathbb N}\) and \(i \in {\mathbb Z}\), the quantity
represents the number of attempts that customer \(i\) (if such a customer exists) has made in \((s,t]\) after its \(m\)th attempt and before receiving service. We first consider those customers who arrived before time \(0\). For each customer \(i\) in the retrial orbit at time \(0\), let \(j^{(N)}(i)\) be the number of failed attempts it has made by time \(0\) and for each customer \(i\) not in the retrial orbit, let \(j^{(N)}(i)=\infty \). Thus, \({{d}}w^{(N)}_{ij^{(N)}(i)}/{{d}}t(0+)>0\) if \(j^{(N)}(i)<\infty \). Let \(\kappa _i^{(N)}\) be the time since time \(0\) that customer \(i\) needs to wait till the next attempt. Let \(M_i^{(N)}\) be the (delayed) renewal process defined by
and
Obviously, for \(t\in [0,\infty )\),
Observe that for \(0\le s<t<\infty \),
and
Then, it is clear that
We next consider those customers arriving after time zero. For \(i=1,\cdots ,E^{(N)}(t)\), let \(M_i^{(N)}\) be the (delayed) renewal process defined by
and
Thus, in this case, for \(t\in [0,\infty )\),
Then, an similar argument in deriving (4.31) yields that
Notice that \(\{\sup _{0\le l \le t} (U_i^{(N)}(l+(t-s))-U_i^{(N)}(l)), i\in {\mathbb Z}\}\) is a sequence of i.i.d. random variables (independent of \(N\)) and is independent of \(\mathcal {E}^{(N)}_0\) and \(E^{(N)}\) due to the assumption on \(\{\{u^i_j, j\in {\mathbb N}\},i\in {\mathbb Z}\}\) and
Combining (4.9) and (4.36) and (4.31) with \(s=0\), we have
Thus, the first part of the lemma follows from (4.37), (4.1). The second part of the lemma, (4.11), follows from the first part of the lemma, the first inequality in (4.37) and an application of the dominated convergence theorem.
Rights and permissions
About this article
Cite this article
Kang, W. Fluid limits of many-server retrial queues with nonpersistent customers. Queueing Syst 79, 183–219 (2015). https://doi.org/10.1007/s11134-014-9415-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-014-9415-9
Keywords
- Retrial queues
- GI/G/N retrial queue
- Fluid limits
- Nonpersistent
- Strong law of large numbers
- Measure-valued processes