Stochastic inequalities for \(M/G/1\) retrial queues. (English) Zbl 0819.60090

Summary: Consider an \(M/G/1\) retrial queue. The performance characteristics of such a system are available in explicit form; however they are cumbersome (these formulas include integrals of Laplace transform, solutions of functional equations, etc.) We use the general theory of stochastic orderings to investigate the monotonicity properties of the system relative to the strong stochastic ordering, convex ordering and Laplace ordering. These results imply in particular simple insensitive bounds for the stationary distribution of the number of customers in the system and the mean number of customers served during a busy period.


60K25 Queueing theory (aspects of probability theory)
60E15 Inequalities; stochastic orderings
Full Text: DOI


[1] Alzaid, A.; Kim, J. S.; Proschan, F., Laplace ordering and its applications, J. Appl. Probab., 28 (1991) · Zbl 0721.60097
[2] Falin, G., A survey of retrial queues, Queueing Systems Theory Appl., 7, 127-168 (1990) · Zbl 0709.60097
[3] Stoyan, D., Comparison Methods for Queues and Other Stochastic Models (1983), Wiley: Wiley New York
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.