Abstract
In this paper, we consider a variant of the classical M/M/c retrial queue, in which we allow non-persistent customers. When c > 1, this system does not have an explicit closed form solution for the joint stationary distribution of the number of retrial customers in the orbit and the number of busy servers. Our main focus is on the tail asymptotics for the joint probabilities. We first present a matrix-product solution for the joint stationary probability vectors, which is further simplified to a scalar-product form, according to matrix-analytic theory. We then apply the censoring technique, which has been proven an efficient approach for analyzing queueing systems including retrial queues, to obtain the censored equations and the Key Lemma. In terms of these results, we finally prove an exact tail asymptotic result for the stationary probabilities.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
