Bounds of the stationary distribution in M/G/1 retrial queue with two-way communication and n types of outgoing calls

In this article we analyze the M=G=1 retrial queue with two-way communication and n types of outgoing calls from a stochastic comparison viewpoint. The main idea is that given a complex Markov chain that cannot be analyzed numerically, we propose to bound it by a new Markov chain, which is easier to solve by using a stochastic comparison approach. Particularly, we study the monotonicity of the transition operator of the embedded Markov chain relative to the stochastic and convex orderings. Bounds are also obtained for the stationary distribution of the embedded Markov chain at departure epochs. Additionally, the performance measures of the considered system can be estimated by those of an M=M=1 retrial queue with two-way communication and n types of outgoing calls when the service time distribution is NBUE (respectively, NWUE). Finally, we test numerically the accuracy of the proposed bounds.

Abstract licence: CC BY-NC-SA

26 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.