Slow Retrial Asymptotics for a Single Server Queue with Two-Way Communication and Markov Modulated Poisson Input

• Published in: Journal of systems science and systems engineering 2019-04, Vol.28 (2), p.181-193
• Main Authors: Nazarov, Anatoly, Phung-Duc, Tuan, Paul, Svetlana
• Format: Article
• Language: English
• Subjects: Approximation; Asymptotic properties; Call centers; Central limit theorem; Communication; Complexity; Customer services; Economic Theory/Quantitative Economics/Mathematical Methods; Engineering; Operations Research/Decision Theory; Poisson density functions; Queues; Waiting rooms
• ISSN: 1004-3756; 1861-9576
• DOI: 10.1007/s11518-018-5404-6

In this paper, we consider an MMPP/M/1/1 retrial queue where incoming fresh calls arrive at the server according to a Markov modulated Poisson process (MMPP). Upon arrival, an incoming call either occupies the server if it is idle or joins a virtual waiting room called orbit if the server is busy. From the orbit, incoming calls retry to occupy the server in an exponentially distributed time and behave the same as a fresh incoming call. After an exponentially distributed idle time, the server makes an outgoing call whose duration is also exponentially distributed but with a different parameter from that of incoming calls. Our contribution is to derive the first order (law of large numbers) and the second order (central limit theorem) asymptotics for the distribution of the number of calls in the orbit under the condition that the retrial rate is extremely low. The asymptotic results are used to obtain the Gaussian approximation for the distribution of the number of calls in the orbit. Our result generalizes earlier results where Poisson input was assumed.