On a Multiserver Retrial Queue with

Phase Type Retrial Time

M. Senthil Kumara , Khosrow Sohraby,a,b , Kiseon Kima
a

Department of Nanobio Materials and Electronics, Gwangju Institute of Science and

Technology,261 Cheomdan-gwagiro (Oryong-dong), Buk-gu, Gwangju, Korea 500-712
b
Department of Computer Science and Electrical Engineering,University of
Missouri,Kansas City, USA

Abstract
This paper concerns a multi-server retrial queueing system with phase type
retrial time distribution. We assume that the time between two successive
repeated attempts follows Phase type distribution (PH-type) independent
of the number of customers applying for service. This system is modelled
as a Quasi-Birth-and-Death (QBD)process. We also describe the analysis
of waiting time distribution. Various performance measures are discussed.
Some interesting numerical illustrations are presented.
Key words: Retrial Queues, QBD, Multi-Server Retrial Queue, PH-Type
Distribution, Waiting Time Distribution
1. Introduction
In this paper, we deal with a branch of the queueing theory, retrial queues,
which is characterized by the following feature: a customer who cannot receive service leaves the service area but after some random time returns to
the system again. As a consequence, repeated attempts for service from the
orbit(i.e., the retrial pool of unsatisfied customers) are superimposed on the
ordinary stream of arrivals of first attempts. The pioneering studies of retrial
queues [10] [15] [22] [23] present the concept of retrial time as an alternative
to the classical models of telephone systems, queues with losses, that do not
Corresponding author
Email addresses: mskumar@gist.ac.kr (M. Senthil Kumar), SohrabyK@umkc.edu
(Khosrow Sohraby), kskim@gist.ac.kr (Kiseon Kim)

Preprint submitted to Elsevier

September 1, 2011

take repeated calls into account.

Several types of retrial queueing models have been established [1] [4]. The
analysis of the models with multi-server retrial systems finds interesting and
practical applications. There is a practical need for the study of such retrial
queueing models. Unfortunately, a simple M/M/c retrial queueing system is
not analytically tractable (see [12]). The stationary distribution of the states
of such system is determined by different approximation methods (see [16]
[21]) based on the similarity of the asymptotic behaviour of a retrial system
and a system without repeated customers.
Many overwhelming research contributions are investigated to get an approximate solution of the classical retrial systems. For instance, [13] has
assumed that the retrial rate becomes infinite when number of customers in
orbit exceeds truncation limit K. Stepanov [24] has described the calculation
of stationary performance measures by truncating the orbit capacity. Neuts
and Rao [19] have developed a tractable approximation, which yields an infinitesimal generator that is essentially a quasi-birth-and-death (QBD) process with a large number of boundary states. QBD processes have been dealt
widely in the queueing literature (see [20]), in which the methods for describing the ergodicity condition and for computing the stationary probabilities
are well investigated. In most of the retrial queueing systems, it is assumed
that any particular customer in orbit tries independently of each other to
enter server after an exponentially distributed time with rate n = n, when
the orbit size is n. However, recent applications in communication protocol
and local area networks show that there are queueing models with retrial
rate n = n where n is the number of customers in the retrial group. This
kind of control retrial policy is well known as constant retrial policy.
The constant retrial policy was introduced by Fayolle [15], who investigated a telephone exchange model as an M/M/1 retrial queue where the
customers in the retrial group form a queue and only the customer at the
head of the orbit can request service after an exponentially distributed retrial
time. Farahmand [14] has studied the M/G/1 retrial queue with constant
retrial policy and its queue length distribution. Retrial queue models are
widely used in data transfer via telephone networks, wireless and cellular
mobile communications networks [25]-[29]. For the conventional M/M/2/2
retrial queue [3], it is known that the generating function of the stationary
2

joint queue length distribution can be expressed in terms of hyper-geometric

functions. As for the case of c 3 number of servers is not less than three),
it is challenging problem to derive an analytical solution for the stationary joint queue length distribution in conventional M/M/c/c retrial queues.
The multi-server retrial queue M/M/c with constant retrial rate was studied
by Artalejo [2], where the system was analysed as QBD process. Ramalhoto and Gomez-Corral [22] has obtained some decomposition formula for
M/M/r/r + d queue with constant retrial rate. For the details on waiting
time and busy period analysis of retrial queues with constant retrial rate,
we can refer Gomez-Corral and Ramalhoto [16]. Krishna Kumar et al. [19]
have analysed the retrial queue with constant retrial rate, finite buffer and
feedback retrial queueing systems. Recenly, Avrachenkov and Morozov [6]
have analysed the stability analysis of GI/G/c/K retrial queue with constant retrial rate. Dmitry Efrosinin et al. [11] have analysed non-reliable
single server queueing system with constant retrial rate and threshold based
recovery.
In this paper, we considered a multi-server retrial queue with phase-type
retrial time distribution. In most of the above papers the analysis of waiting time distribution is discussed by truncating the number of customers as
finite [5]. The lack of the analysis of waiting time distribution motivates us
to consider this problem. In practice, there are some practical applications
considering the retrial time as non-exponential distribution. The models
in communication networks operating under unslotted CSMA/CD (carrier
sense multiple access with collision detection) protocol repeats its request
for retransmission after a random amount of time when the transmission is
busy.[7] [8] [9] So, we consider the multi-server retrial queue with phase-type
retrial time distribution. We have obtained the Laplace transform of conditional and unconditional waiting time distributions for our model. Some
interesting special cases are also discussed. We illustrated some interesting
numerical examples.
The rest of paper is organized as follows: Section 2 describes the mathematical model and defines necessary and sufficient condition for stability.
Section 3 presents performance characteristics of this system. Section 4 provides the recursive expressions for the calculation of the Laplace transforms of
conditional waiting time distribution and unconditional waiting time distribution. Section 5 provides some important insights of this system. Numerical
3

results are illustrated in Section 6.

In further sections we will use the notations I as the m m identity
Matrix and e as the column vector of all entries as 1.
2. Mathematical Model
We assume that the packets arrive according to a Poisson process with
rate . In this system, there are c servers. If all servers are busy, the arriving
packet join the pool of retrial customers. The customers in head of orbit
retry for getting into service. We assume that the retrial time distribution
of phase type PH (, )whose distribution is F (t) = 1 exp(t)e, t 0,
where = (1 , ...., m ) with e = 1, = (ij ) is a nonsingular m m
matrix and e is the column m-vector whose components are all 1. Let
= e = (1 , ..., m )t . The service time of any customer is distributed
with the exponential distribution with parameter .
We study the stationary characteristics of the retrial queue of type M/M/c
with phase type retrial distribution. This model is a QBD process on state
space S = Z+ {0, 1, 2, ...c} {1, 2, ..m}. The system state at time t consists
of the number of customers in orbit, the number of busy servers and phase
of retrial time. Its infinitesimal generator Q is of the form

B0 A0 0 0 0
B1 A1 A0 0 0

0 A2 A1 A0 0

Q = 0 0 A A A
2
1
0

..
..
.. . . . . . .
.
.
.
.
.
.
where all blocks are square matrices of order m (c + 1). In the case c=3,
the matrices A0 , A1 and A2 are given by,

0 0 0 0
0 0 0 0

A0 =
0 0 0 0
0 0 0 I
4


0
0
0
0
0

A2 =
0
0
0

0
0
0
0

I
I
0
0

I
( + )I
I
0

A1 =

0
2I
( + 2)I
I
0
0
3I
( + 3)I

The matrix matrix B1 = A2 and B0 is similar to A1 but with omitted.

Note that the matrix A = A0 + A1 + A2 is the generator of the M/M/c/c loss
system. The stationary probability vector of A is given by . The vector ,
partitioned as, = (0 , 1 , ..., c ) is computed as follows:
0 = I1 (I )1
i = (i1 (I + ( ) + i+1 (i + 1))(( + i)I )1 1 i c 1
c = c1 (I + ( ))(cI)1
P
subject to ci=0 i e = 1.
The general theory in [13] states that:
(i) A2 e > A0 e is the necessary and sufficient condition for stability. e
denotes a column vector with all its elements equal to 1.
(ii) the stationary probability vector x, participated as x = (x0 , x1 , ...) of
Q is given by,
x0 (B0 + RA2 ) = 0,
xi = x0 Ri , i 1
x0 (I R)1 e = 1

(1)

where R is minimal non-negative solution to the matrix equation R2 A2 +

RA1 + A0 = 0 and xi , i 0, is a matrix of dimension m (c + 1).

2.1. Computation of R Matrix

In this section, we present an alternative way of computing R matrix,
which is main ingredient for discussing the qualitative behaviour of the system under study.
Due to the special structure of the matrix A0 , the square matrix R of
dimension m (c + 1). The matrix R can be explicitly determined once its
eigenvalues are known. To be precise, due to structure of A0 , R is of the
form

0 0 0
0 0 0

..
..
R = ... ...
.
.

0 0 0
r1 r2 rc+1
where r1 , r2 , and rc+1 are m m matrices. One of the simple way to find
the matrix R is given by limn R(n) where R(n) is a sequence of matrices
defined by
R(0) = 0
(n1) 2
R(n) = (A0 A1
) A2 A1
1 + (R
1 ), n 1

(2)

Once R is known the stationary distribution x is readily obtained from Q.

3. Performance Metrics
Once the vector x is computed, a variety of other performance characteristics may be routinely obtained. Some of these are:
1. The blocking probability:
Pb =

X
m
X

Pi,c,j = (x0 (I R)1 )c

(3)

i=0 j=1

2. The mean number of busy servers

Y =

X
c X
m
X

jPi,j,k = x0 (I R)1 (0, 1, 2, ..., c)T = /

i=0 j=1 k=1

(4)

3. The factorial moments of the number of customers in orbit

E[N k ] = k!x0 Rk (I R)1k e, k 1

(5)

4. Waiting time of the number of customers in orbit

E[N]

(6)

(x0 )1
0 1

(7)

E[W ] =
5. The mean busy period
T =
6. The overall rate of retrials

1 XX
1
r =
Pi,j =
(1 x0 e)
E[R] i=1 j=0
E[R]

(8)

7. The rate of retrials that are successful

c1

1 XX
Pi,j = Pb
s =
E[R] i=1 j=0

(9)

8. The fraction of retrials that are successful

f=

s
r

(10)

It is noted that all main performance measures can be directly expressed

in terms of x0 and R. So, the above formulas can be considered as closed
form expressions. Next we present the waiting time distribution of the above
system.
Theorem
Average number of busy servers is / independent of retrial distribution
and arrival process or service time distribution

Proof. By Littles law, the average waiting time of system is sum of

average time spent in orbit and in service.
E[Ws ] = E[Worbit ] +

E[Ws ] = E[Worbit ] +

(11)

E[Ns ] = E[Norbit ] + Average number of busy servers

Therefore average number of busy servers Y = .
4. Waiting Time distribution
In this section, we analyse the distribution of the waiting time W in the
retrial queue, taking into account that the customers are served in order of
their arrival. Here we consider the arrival of tagged customer up to the time
where its service starts. The further manipulation is performed by analysing
the auxiliary Markov chain just after of the tagged customer at time t+
b
{X(t)}
{tt+ } = {N(t), S(t), J(t), M(t)}{tt+ }

b = {(n, i, j, k)|nN; i{0, 1, 2, ...c}; j{1, 2, ..., m}; kN0 }

with state space X
and absorption at the time when the tagged customer receives the service.
N(t) denotes the number of customers in orbit at time t and S(t) denotes
number of busy server at time t. M(t) of the process denotes the position of
the tagged customer in the list of orbiting customers at time t. J(t) denotes
phase of retrial time at time t. M(t) can only decrease at retrial time when
an orbital customer finds atleast one server is idle. If all c servers are busy,
then we obviously have M(t+ ) = N(t+ ). The process is absorbed when M(t)
becomes zero.
First we perform the Laplace transform of the conditional waiting time
distribution given the system state and the position of the tagged customer
just after the arrival. Using the law of total probability and the state distribution just after the arrival of the tagged customer, the conditioning is removed.

Denote the Laplace transform of the conditional waiting time by wn,i,j,k (s)
given state x = (n, i, j, k). Then due to PASTA property and law of total
probability the unconditional Laplace transform is of the form,
!
X
m
X
m
X
X
w(s)

= 1
Pn,c,j +
Pn,c,j wn+1,c,j,n+1(s)
(12)
n=0 j=1

n=1 j=1

where the first term represents the stationary probability that a tagged customer does not have to wait for service; the last term represents the Laplace
transform of the waiting time given W > 0
Further we partition the above conditional Laplace transforms according to the number of customers in the retrial queue and position of tagged
customer. Denote
wn,i,k (s) = (wn,i,1,k (s), wn,i,2,k (s), ...wn,i,m,k (s))
wn,k (s) = (wn,0,k (s), wn,1,k (s), ...., w
n,c,k (s))

(13)

In the following theorem we find the conditional Laplace transform of waiting

time distribution.
Theorem
The vector of conditional Laplace transforms wn,k (s), n 0 under stability
condition statisfy the following recurrent relations.
kn

kn1
X

M r (s)L(s)wn+r,k1(s), n 0

(14)

w
k,k (s) = ck1 (s)(0 (s), 1 (s), ..., c (s))T ; wn,0 (s) = (0, 0, ...1)T
where M(s) = (A1 sI)1 A0 ; L(s) = (A1 sI)1 A2

(15)

wn,k (s) = M

(s)w
k,k (s) +

r=0

Proof:
b
The Markov property of the process {X(t)}
implies the following system

(( + i + s)I ) wn,i,k (s) = wn,i+1,k (s) + ( )w

n1,i+1,k1(s) + iwn,i1,k (s)
0 i (c 1)
(( + c + s)) wn,c,k = wn+1,c,k (s) + cwn,c1,k (s)
9

where wn,c,0(s) = 1 and wn,i,0(s) = 0; 0 i (c 1). After finding the block

identification, the above system can be expressed in the matrix form
(A1 sI) wn,k (s) + A0 wn+1,k (s) + A2 wn1,k1(s) = 0
Applying (k n) times the recursive forward substitution, we prove the
above equations. To calculate this vector we derive the Laplace transforms
i (s) = (i,1 (s), i,2 (s), ..., i,m (s)) of the waiting time for the customer at
the head of the retrial queue given that the initial server state i{0, 1, 2, ...c}.
Consider the auxiliary Markov chain with absorbing state upon successive
retrial. Then the values of i (s) satisfy the following system of equations
(( + i + s)I ) i (s) = i+1 (s) + ii1 (s) + ; 0 i c 1 (16)
(c + s)c (s) = cc1 (s)

(17)

Solving above equations we obtain i (s). If we take into account the

sequence of epochs at which the queue size decreases in one unit, we easily
find the vector of conditional Laplace transforms wn,k (s).
4.1. Unconditional waiting time distribution
From the above theorem, it is easy to find the unconditional Laplace
transform of waiting time distribution w(s)

under stability condition. w(s)

is given by,

w(s)

m
X
X

Pn,c,j

n=0 j=1

X
m
X
n=0 j=1

Pn,c,j

m
X
X

Pn,c,j wn+1,c,j,n+1(s)

n=1 j=1

m X

(x0 Rn )c,j (c,j (s))n+1

(18)

j=1 n=1

5. Special Cases
1.If the number of phases m = 1, the time between retrial follows exponential distribution with rate . In this case, we can determine the R matrix
in two ways.

10

The first way to compute the R matrix is as follows: The R matrix is of the
following form:

0 0 0
0 0 0

.. ..
.
.
.
.
(19)
R= . .
.
.

0 0 0
r1 r2 rc+1
where r1 , r2 , ...rc+1 are scalars. rc+1 is the eigenvalue of R Matrix. The
eigenvector of the R matrix u = (r1 , r2 , ..., rc+1). So we can find u as follows:
uR = rc+1 u

(20)

2
Here rc+1 is root in (0, 1) of Det(rc+1
A2 + rc+1 A1 + A0 ) = 0 . To find
the eigenvalue of R matrix we have the following iterative procedure. Let
4(z) =| A0 + A1 z + A2 z 2 | . Due to structure of A0 ,4(z) = 0 has always
z = 1 as one of the root and z = 0 as repeated roots. Therefore

4 (z) = z c (z 1)f (z)

If 4(z) = 0 f (z) = 0
f (z) = g(z) + c1 z = 0 z =

g(z)
c1

The iterative procedure for finding the eigenvalue is given by

z0 = 1
zn+1 =

g(zn )
= h(zn )
c1

(21)
(22)

Once we get the spectral radius rc+1 we can find the vector u by the following
procedure.
2
u(rc+1
A2 + rc+1 A1 + A0 ) = 0

Further more, the general equation RA2 e = A0 e gives,

ue =

+ rc+1

11

(23)

2. If the retrial time follows exponential distribution, the unconditional

Laplace transform of waiting time distribution w(s)

is given by:

w(s)

=
=

1
1

Pn,c

n=0

Pn,c

n=0

Pn,c

n=0

Pn,c wn+1,c,n+1(s)

n=1

(x0 Rn )c (c (s))n+1

n=1

+ x0,c c (s)/(1 rc+1 c (s))

(24)

6. Numerical Results
In this section we demonstrate the effect of the parameters on the performance measures. To that end, we assumed that the hyper-exponential retrial
time distribution H2 of order 2 and Erlang k retrial time distribution. H2
has probability density function as
f (t) = p1 e1 t + (1 p)2 e2 t , t 0


1+

where the parameters are p =

C 2 1 is coefficient of variation.

C 2 1
C 2 +1

1 =

2p
m1

and 2 =

(25)
2(1p)
m1

and

6.1. The impact of squared coefficient of variation of retrial time (CR2 ) over
2
squared coefficient of variation of waiting time (CW
)
The numerical results for waiting time is obtained by truncation. In Fig
1. the retrial time follows the Hyper-exponential distribution H2 . For hyper2
exponential distribution CR2 > 1. We present the values CW
for the varying
2
CR . In Table 2. the impact of Erlang k retrial distribution on the waiting
2
time is discussed. For Erlang k distribution, CR2 < 1. As k increases, CW
decreases.

12

6.2. Trade-off between blocking probability and mean waiting time

In general, there is a strong trade-off between delay and blocking probability as retrial rate change. For c = 2, if = 0.5, = 1c , the blocking probability at retrial rate v = , Pb =0.33 and at retrial rate v = 0, Pb = 0.293,
so blocking probability increases and average delay decreases as retrial rate
increases. For c = 3 servers, Pb ranges is in [0.18,0.23] as retrial rate changes
when = 0.5, = 1/c assumed. Similarly say = 0.5, = 1/c, for c = 4
servers Pb ranges in [0.15, 0.17] and for c = 5 servers Pb ranges in [0.11,
0.13]. It is noted that as retrial rate tends to , the blocking probability approaches to blocking probability of classical M/M/c queueing model. From
Figure 2 - Figure 4, it is clearly noticed that there is a trade-off between the
probability of blocking and expected waiting time E[W ]. Moreover as the
retrial rate v tends to the probability of blocking approaches to Pb of the
classical M/M/c queueing system.
lim Pb =

(c)c /c!
P
k
[(c)c /c! + (1 ) c1
k=0 (c) /k!]

(26)

6.3. The effect of arrival rate on N and E[Tc ]

The expected amount of time in a cycle during which C(t) = c is E[Tc ].
From the theory of regenerative processes, E[Tc ] is related to the other system
parameters by
E[Tc ] = Pb (1 + T ) =

Pb
P00

(27)

The effect of arrival rate on N and E[Tc ] is depicted in the table 3. If

increases, N and E[Tc ] are increasing. This effect is depicted by considering
Hyper-Exponential and Erlang-3 retrial time distribution.
6.4. Approximation on tail of the orbit size distribution P [X > k]
The approximation on tail of the orbit size distribution is given by
P (X > k) ' (R )k

13

(28)

where = (A0 e)/(A2 e) and R is the dominant eigenvalue of R. From the

Figure 5, we can very easily notice that the impact of dominant eigenvalue
on P (X > k). The exact value of P (X > k) is given by,
P (X > k) = x0 Rk+1 (I R)1 e

(29)

We compare the above results on different number of servers. The impact

of dominant eigenvalue of R is closely approximating the probability that
X > k. This is shown in the Figure 5. The graph is plotted over log-scale of
P [X > k].
7. Acknowledgements
This work was partially supported by the World Class University (WCU)
program at GIST through a grant provided by the Ministry of Education,
Science and Technology (MEST) of Korea (Project No. R31-10026).
2 versus c and k of Erlang k
Table 1: Squared coefficient of variation CW
distribution Erk

k
1
2
3
4
5

c=2
0.145
0.139
0.137
0.136
0.135

c=4
0.595
0.570
0.562
0.558
0.555

14

c=6
2.036
1.952
1.924
1.909
1.902















 &:

&:

F 



F 

F 





F 

F 





F 










&5

&5

2 versus C 2
Figure 1: CW
R




3E




















Y

Y





(>:@





 










)LJD 


   )LJE
Figure
 2: Probability of Blocking Pb versus Retrial Rate v and E[W ] versus
Retrial rate v when c=2





 

(>:@



3E

 

 




 

  


 )LJD 





   )LJE
Y

Y



         



 


Figure 3: a) Probability of Blocking Pb versus Retrial Rate v and b) E[W ]

versus Retrial rate v when c=4



15
3E















(>:@



(>:@



3E














Y

Y



         

 








3E

(>:@














Y

Y




         

 



Figure 4: a) Probability of Blocking Pb versus Retrial Rate v and b) E[W ]

versus Retrial rate v when c=6



P[X>k]

Figure 5: Probability that X > k (P [X > k]) versus k

16

2 of Hyper Exponential
Table 2: Expected Waiting Time E[W ] versus c and CR
retrial time H2

CR2
1
2
3
4
5

c=2
0.325
0.333
0.340
0.346
0.353

c=3
0.129
0.133
0.136
0.138
0.140

c=4
0.059
0.061
0.062
0.063
0.064

Table 3: Effect of arrival rate on E[N ] and E[Tc ] if retrial time follows H2
and Erlang 3(Er3 )

0.2
0.3
0.4
0.5
0.6
0.7
0.8

H2
E[N]
0.002
0.016
0.074
0.251
0.737
2.203
10.038

E[Tc ]
0.048
0.270
0.975
2.857
7.717
21.986
97.668

Er3
E[N]
0.002
0.016
0.072
0.240
0.693
2.008
8.191

E[Tc ]
0.047
0.264
0.949
2.762
7.373
20.472
81.805

References
[1] J.R.Artalejo and Antonio Gomez-Corral, Retrial Queueing Systems - A
Computational Approach, Springer, 2008.
[2] J.R.Artalejo, A. Gomez-Corral and M.F.Neuts , Analysis of multiserver
queues with constant retrial rate, European Journal of Operational Research, 135 (2001) 569-581.
[3] J.R.Artalejo, Stationary analysis of the characteristics of the M/M/2
queue with constant repeated attempts, Opsearch 33(1996) 83-95.

17

[4] J.R.Artalejo, Accessible bibliography on retrials: Progress in 2000-2009,

Mathematical and Computer Modelling, 51 (2010) 1071-1081.
[5] J.R.Artalejo, S.R.Chakravarthy, and M.J.Lopez-Herrero, The Busy Period and the Waiting Time Analysis of a MAP/M/c Queue with Finite
Retrial Group, Stochastic Analysis and Applications 25 (2007) 445-469.
[6] Avrachenkov, K., and Morozov, E. (2010). Stability Analysis of
GI/G/c/K Retrial Queue with Constant Retrial Rate. Sophia, (July
2010). Retrieved from http://arxiv.org/abs/1007.1548
[7] B.D. Choi, Y.W.Shin, and W.C. Ahn, Retrial queues with collision arising from unslotted CSMA/CD protocol, Queueing Sytems, 11 (1992)
335-356.
[8] B.D.Choi, K.K.Park and C.E.M.Pearce An M/M/1 retrial queue with
control policy and general retrial times, Queueing Systems 14 (1993)
275-292.
[9] B.D.Choi, K.H.Rhee and K.K.Park, The M/G/1 retrial queue with retrail rate control policy, Probability in the Engineering and Informational Sciences, 7 (1993) 29-46.
[10] J.W. Cohen, Basic problems of telephone traffic theory and the influence
of repeated calls, Philips Telecommunication Review 18 (1957) 29-46.
[11] Dmitry Efrosinin, Anastasia Winkler, Queueing System with a constant
retrial rate, non-reliable server and threshold-based recovery, European
Journal of Operational Research 210 (2011) 594-605.
[12] G.I.Falin and J.G.C. Templeton, Retrial Queues, Chapman and Hall,
Londan, 1997.
[13] G.I.Falin, Calculation of probability characteristic of a multiline system
with repeat calls, Moscow Univ. Comput. Math. Cybernet. 1 (1983)
43-49.
[14] K.Farahmand, Single line server queue with repeated demands, Queueing System, 6 (1990) 223-228.

18

[15] G.Fayolle, A simple telephone exchange with delayed feedbacks, in :

O.J. Boxma, J.W.Cohen , M.C.Tijms (Eds), Teletraffic analysis and
computer performance evaluation, North Holland, Amsterdam, 1986,
pp.245-253.
[16] A.Gomez-Corral, M.F.Ramalhoto, On the stationary distribution of a
Markovian process arising in the theory of multiserver retrial queueing
systems, Mathematical and Computer Modelling 30 (1999) 141-158.
[17] A.Gomez-Corral, M.F.Ramalhoto, On the waiting time distribution and
the busy period of a retrial queue with constant retrial rate, Stochastic
Modelling and Applications 3 (2) (2000) 37-47.
[18] G.M. Koole and A. Mandelbaum. Queueing models of call centers: an
introduction. Annals of Operations Research, , 113 (2002) 41-59.
[19] B.Krishna Kumar, S.Pavai Madheswari, A.Vijayakumar, On multiserver
feedback retrial queue with finite buffer, Applied Mathematical Modelling 33(2009) 2062-2083.
[20] M.Martin, J.R.Artalejo, Analysis of an M/G/1 queue with types of impatient units, Advances in Applied Probability, 27 (1995) 8440-861.
[21] M.F.Neuts, B.M.Rao, Numerical investigation of a multiserver retrial
model, Queueing Systems, 7 (1999) 169-190.
[22] M.F.Neuts, Matrix-geometric Solutions in Stochastic Models- An Algorithmic Approach, John Hopkins University Press, Baltimore, MD,
1981.
[23] C.E.M. Pearce, Extended continued fractions, recurrence relations and
two dimensional Markov Processes, Advances in Applied Probability 21
(1989) 357-375.
[24] M.F.Ramalhoto, A.Gomez-Corral, Some decomposition formulae for
M/M/r/r + d queue with constant retrial rate, Stochastic models 14
(1998) 123-145.
[25] S.N. Stepanov, Markov models with retrials: The calculation of stationary performance measures based on the concept of truncation, Mathematical and Computer Modelling, 30 (1999) 207-228.
19

[26] P.Tran-Gia and M. Mandjes, Modelling of customer retrial phenomenon

in cellular mobile networks, IEEE Journal of Selected Areas of Communications, 15 (8) (1997) 1406-1414.
[27] N.Vlajic, C.D.Charalambous, and D.Makrakis, Performance aspects of
data broadcast in wireless networks with user retrials, IEEE/ACM
Trans. Networking, 12 (4) (2004) 620-633.
[28] R.I.Wilkinson, Theories for toll traffic engineering in the USA, Bell System Technical Journal, 35 (1956) 421-514.
[29] M.Zukerman and C.M.Lee, Performance bounds for cellular mobile communications networks with repeated attempts, in Proc. IEEE 53rd Vehicular Technology Conference, 2 (2001) 996-1000.

20