stochastic approximations and monotonicity of a single server feedback retrial queue随机近似和单调性的单个服务器反馈重审队列.pdf

Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2012, Article ID 536982, 13 pages doi:10.1155/2012/536982 Research Article Stochastic Approximations and Monotonicity of a Single Server Feedback Retrial Queue 1 2 ¨ 1 Mohamed Boualem, Natalia Djellab, and Djamil Aıssani 1 Laboratory of Modeling and Optimization of Systems, University of Bejaıa, Bejaıa 06000, Algeria ´ ¨ ´ ¨ 2 Department of Mathematics, University of Annaba, Annaba 23000, Algeria Correspondence should be addressed to Mohamed Boualem, robertt15dz@yahoo.fr Received 30 October 2011; Accepted 16 January 2012 Academic Editor: M. D. S. Aliyu Copyright q 2012 Mohamed Boualem et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. This paper focuses on stochastic comparison of the Markov chains to derive some qualitative approximations for an M/G/1 retrial queue with a Bernoulli feedback. The main objective is to use stochastic ordering techniques to establish various monotonicity results with respect to arrival rates, service time distributions, and retrial parameters. 1. Introduction Retrial queueing systems are described by the feature that the arriving customers or calls who find the server busy join the orbit to try again for their requests in a random order and at random time intervals. Retrial queues are widely and successfully used as mathematical models of several computer systems and telecommunication networks. For excellen