Optimizing buffer size for the retrial queue: two state space collapse results in heavy traffic

Rami Atar () and Anat Lev-Ari ()
Additional contact information
Rami Atar: Technion–Israel Institute of Technology
Anat Lev-Ari: Technion–Israel Institute of Technology

Queueing Systems: Theory and Applications, 2018, vol. 90, issue 3, No 2, 225-255

Abstract: Abstract 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.

Keywords: Retrial queue; Diffusion approximation; Heavy traffic; The Harrison–Taksar free boundary problem; State space collapse; 60F17; 60J60; 60K25; 93E20 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11134-018-9585-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:90:y:2018:i:3:d:10.1007_s11134-018-9585-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-018-9585-y

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().