We study a single server queueing model with admission control and retrials. In the heavy traffic limit, the main queue and retrial queue lengths jointly converge to a degenerate two-dimensional diffusion process. When this model is considered with holding and rejection costs, formal limits lead to a free boundary curve that determines a threshold on the main queue length as a function of the retrial queue length, above which arrivals must be rejected. However, it is known to be a notoriously difficult problem to characterize this curve. We aim instead at optimizing the threshold on the main queue length independently of the retrial queue length. Our main result shows that in the small and large retrial rate limits, this problem is governed by the Harrison–Taksar free boundary problem, which is a Bellman equation in which the free boundary consists of a single point. We derive the asymptotically optimal buffer size in these two extreme cases, as the scaling parameter and the retrial rate approach their limits.
Retrial queue Diffusion approximation Heavy traffic The Harrison–Taksar free boundary problem State space collapse
Mathematics Subject Classification
60F17 60J60 60K25 93E20
This is a preview of subscription content, log in to check access.
This research was supported in part by the ISF (Grant 1315/12).
Abramov, V.M.: Analysis of multiserver retrial queueing system: a martingale approach and an algorithm of solution. Ann. Oper. Res. 141(1), 19–50 (2006)CrossRefGoogle Scholar
Anisimov, V., Atadzhanov, K.L.: Diffusion approximation of systems with repeated calls and an unreliable server. J. Math. Sci. 72(2), 3032–3034 (1994)CrossRefGoogle Scholar
Anisimov, V.V.: Switching stochastic models and applications in retrial queues. Top 7(2), 169 (1999)CrossRefGoogle Scholar
Artalejo, J., Falin, G.: Standard and retrial queueing systems: a comparative analysis. Revista Matematica Complutense 15(1), 101–129 (2002)Google Scholar