Showing papers on "Retrial queue published in 1992"
TL;DR: TheM/G/1 batch arrival retrial queue is studied by means of branching processes with immigration when traffic intensity is less than one, tends to one or is greater than one.
Abstract: TheM/G/1 batch arrival retrial queue is studied by means of branching processes with immigration. We shall investigate this queue when traffic intensity is less than one, tends to one or is greater than one.
30 citations
TL;DR: This paper considers a service station consisting of s identical, independent exponential servers and m buffers, and an efficient algorithm is developed to evaluate system steady-state probabilities, and formulas for certain system performance measures are derived in terms of the steady- state probabilities
Abstract: This paper considers a service station consisting of s identical, independent exponential servers and m buffers. Customers arrive according to a Coxian process with a stages. Blocked customers may either leave the system forever or return, after an exponentially distributed amount of time, to the service station to retry for services. An efficient algorithm is developed to evaluate system steady-state probabilities, and formulas for certain system performance measures are derived in terms of the steady-state probabilities. The computational complexity of the algorithm is shown to be O(4N), where N is the total number of state probabilities evaluated. The influence of the form of interarrival time distributions on system performance measures is examined through numerical results. Issues concerning numerical stability of the algorithm are also discussed. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
4 citations