stability of retrial queues with versatile retrial policy重审队列与通用的重审政策的稳定.pdfVIP

STABILITY OF RETRIAL QUEUES WITH VERSATILE RETRIAL POLICY ¨ TEWFIK KERNANE AND AMAR AISSANI Received 19 December 2004; Revised 22 November 2005; Accepted 22 November 2005 We consider in this paper the stability of retrial queues with a versatile retrial policy. We obtain sufficient conditions for the stability by the strong coupling convergence to a stationary ergodic regime for various models of retrial queues including a model with two types of customers, a model with breakdowns of the server, a model with negative customers, and a model with batch arrivals. For all the models considered we assume that the service times are general stationary ergodic and interarrival and retrial times are i.i.d. sequences exponentially distributed. For the model with unreliable server we also assume that the repair times are stationary and ergodic and the occurrences of breakdowns follow a Poisson process. ¨ Copyright © 2006 T. Kernane and A. Aıssani. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, dis- tribution, and reproduction in any medium, provided the original work is properly cited. 1. Introduction We investigate in this paper the problem of stability condition for some retrial queueing models. The first model is a retrial queue with a versatile retrial policy which incorporates simultaneously the classical linear retrial policy and the constant one and is described as follows. Consider a single server queue in which a primary arriving customer who finds the server busy moves to a group of blocked customers called “orbit” and repeatedly re- tries for service until he finds the server free, and consider the following retrial policy for the access to the server from the orbit. The probability of a repeated attempt from the orbit during the interval (t, t + Δt), given that j customers were