Stability of retrial queues with versatile retrial
              policy

Kernane, Tewfik; Aïssani, Amar

doi:https://doi.org/10.1155/JAMSA/2006/54359

International Journal of Stochastic Analysis

On this page

Abstract References Copyright Related Articles

Open Access

Volume 2006 | Article ID 054359 | https://doi.org/10.1155/JAMSA/2006/54359

Stability of retrial queues with versatile retrial policy

Tewfik Kernane¹and Amar Aïssani²

Received19 Dec 2004

Revised22 Nov 2005

Accepted22 Nov 2005

Published14 May 2006

Abstract

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.

References

I. Akhmarov and N. P. Leont'eva, “Conditions for convergence to limit processes, and the strong law of large numbers for queueing systems,” Teoriya Veroyatnostei i ee Primeneniya, vol. 21, no. 3, pp. 559–570, 1976 (Russian).
View at: Google Scholar | Zentralblatt MATH | MathSciNet
E. Altman and A. A. Borovkov, “On the stability of retrial queues,” Queueing Systems, vol. 26, no. 3-4, pp. 343–363, 1997.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
J. R. Artalejo, “ $G$ -networks: a versatile approach for work removal in queueing networks. $G$ -networks,” European Journal of Operational Research, vol. 126, no. 2, pp. 233–249, 2000.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
J. R. Artalejo and A. Gomez-Corral, “Steady state solution of a single-server queue with linear repeated requests,” Journal of Applied Probability, vol. 34, no. 1, pp. 223–233, 1997.
View at: Google Scholar | Zentralblatt MATH | MathSciNet
J. R. Artalejo and A. Gomez-Corral, “Generalized birth and death processes with applications to queues with repeated attempts and negative arrivals,” OR Spektrum, vol. 20, no. 1, pp. 5–14, 1998.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
J. R. Artalejo and A. Gomez-Corral, “On a single server queue with negative arrivals and request repeated,” Journal of Applied Probability, vol. 36, no. 3, pp. 907–918, 1999.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
S. Asmussen and S. G. Foss, “Renovation, regeneration, and coupling in multiple-server queues in continuous time,” in Frontiers in Pure and Appl. Probab, H. Niemi et al., Ed., vol. 1, pp. 1–6, VSP, Utrecht, 1993.
View at: Google Scholar | Zentralblatt MATH
A. A. Borovkov, Stochastic Processes in Queueing Theory, Applications of Mathematics, no. 4, Springer, New York, 1976.
View at: Zentralblatt MATH | MathSciNet
A. A. Borovkov, Asymptotic Methods in Queueing Theory, Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics, John Wiley & Sons, Chichester, 1984.
View at: Zentralblatt MATH | MathSciNet
A. A. Borovkov, Ergodicity and Stability of Stochastic Processes, Wiley Series in Probability and Statistics: Probability and Statistics, John Wiley & Sons, Chichester, 1998.
View at: Zentralblatt MATH | MathSciNet
J. L. Doob, Stochastic Processes, John Wiley & Sons, New York; Chapman & Hall, London, 1953.
View at: Zentralblatt MATH | MathSciNet
G. I. Falin, “Aggregate arrival of customers in one-line system with repeated calls,” Ukranian Mathematical Journal, vol. 28, no. 4, pp. 437–440, 1976.
View at: Publisher Site | Google Scholar
G. I. Falin, “Functioning under nonsteady conditions of a single-channel system with group arrival of requests and repeated calls,” Ukrainian Mathematical Journal, vol. 33, no. 4, pp. 429–432, 1981.
View at: Publisher Site | Google Scholar
G. Fayolle, “A simple telephone exchange with delayed feedbacks,” in Teletraffic Analysis and Computer Performance Evaluation, O. J. Boxma, J. W. Cohen, and H. C. Tijms, Eds., pp. 245–253, Elsevier Science, Amsterdam, 1986.
View at: Google Scholar
S. G. Foss, “The method of renovating events and its applications in queueing theory,” in Semi-Markov Models (Brussels, 1984), pp. 337–350, Plenum, New York, 1986.
View at: Google Scholar | MathSciNet
S. G. Foss and V. V. Kalashnikov, “Regeneration and renovation in queues,” Queueing Systems, vol. 8, no. 3, pp. 211–223, 1991.
View at: Google Scholar | Zentralblatt MATH | MathSciNet
E. Gelenbe, “Product-form queueing networks with negative and positive customers,” Journal of Applied Probability, vol. 28, no. 3, pp. 656–663, 1991.
View at: Google Scholar | Zentralblatt MATH | MathSciNet
E. Gelenbe, P. Glynn, and K. Sigman, “Queues with negative arrivals,” Journal of Applied Probability, vol. 28, no. 1, pp. 245–250, 1991.
View at: Google Scholar | Zentralblatt MATH | MathSciNet
Y. Kifer, Ergodic Theory of Random Transformations, Birkhäuser Boston, Massachusetts, 1996.
H. M. Liang and V. G. Kulkarni, “Stability condition for a single-server retrial queue,” Advances in Applied Probability, vol. 25, no. 3, pp. 690–701, 1993.
View at: Google Scholar | Zentralblatt MATH | MathSciNet
M. Martin and J. R. Artalejo, “Analysis of an $M/G/1$ queue with two types of impatient units,” Advances in Applied Probability, vol. 27, no. 3, pp. 840–861, 1995.
View at: Google Scholar | Zentralblatt MATH | MathSciNet

Copyright

Copyright © 2006 Tewfik Kernane and Amar Aïssani. 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.

PDF Download Citation Order printed copies

Views

202

Downloads

609

Citations