Stochastic analysis of a single server retrial queue with general retrial times

Retrial queueing systems are widely used in teletraffic theory and computer and communication networks. Although there has been a rapid growth in the literature on retrial queueing systems, the research on retrial queues with nonexponential retrial times is very limited. This paper is concerned with the analytical treatment of an M/G/1 retrial queue with general retrial times. Our queueing model is different from most single server retrial queueing models in several respectives. First, customers who find the server busy are queued in the orbit in accordance with an FCFS (first-come-first-served) discipline and only the customer at the head of the queue is allowed for access to the server. Besides, a retrial time begins (if applicable) only when the server completes a service rather upon a sen ice attempt failure. We carry out an extensive analysis of the queue, including a necessary and sufficient condition for the system to be stable, the steady state distribution of the server state and the orbit length, the waiting time distribution, the busy period, and other related quantities. Finally, we study the joint distribution of the server state and the orbit length in non-stationary regime.

[1]  Julian Keilson,et al.  A Service System with Unfilled Requests Repeated , 1968, Oper. Res..

[2]  James G. C. Templeton,et al.  A survey on retrial queues , 1989 .

[3]  V. A. Kapyrin.  Stationary characteristics of a queuing system with repeated calls , 1977 .

[4]  Marcel F. Neuts,et al.  A service model in which the server is required to search for customers , 1984 .

[5]  Behnam Pourbabai,et al.  A note on a D/G/K loss system with retrials , 1990, Journal of Applied Probability.

[6]  G. F. Newell,et al.  Introduction to the Theory of Queues. , 1963 .

[7]  Linn I. Sennott,et al.  Technical Note - Mean Drifts and the Non-Ergodicity of Markov Chains , 1983, Oper. Res..

[8]  Jesús R. Artalejo,et al.  On the orbit characteristics of the M/G/1 retrial queue , 1996 .

[9]  W. Whitt,et al.  Multidimensional Transform Inversion with Applications to the Transient M/G/1 Queue , 1994 .

[10]  C. E. M. Pearce,et al.  AnM/M/1 retrial queue with control policy and general retrial times , 1993, Queueing Syst. Theory Appl..

[11]  Gennadi Falin.  Single-line repeated orders queueing systems 1 , 1986 .

[12]  Robert B. Cooper,et al.  An Introduction To Queueing Theory , 2016 .

[13]  J. R. Artalejo,et al.  Analysis of an M/G/1 queue with two types of impatient units , 1995, Advances in Applied Probability.

[14]  Gennadi Falin,et al.  A survey of retrial queues , 1990, Queueing Syst. Theory Appl..

[15]  Jesús R. Artalejo,et al.  Steady state solution of a single-server queue with linear repeated requests , 1997, Journal of Applied Probability.

[16]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

[17]  Hui Li,et al.  An approximation method for the M/G/1 retrial queue with general retrial times , 1994 .

[18]  Ward Whitt,et al.  The Fourier-series method for inverting transforms of probability distributions , 1992, Queueing Syst. Theory Appl..