See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/294831810

A single server retrial queue with Bernoulli working vacation and vacation
interruption

Article  in  International Journal of Applied Engineering Research · February 2016

CITATION READS

1 136

3 authors, including:

P. Rajadurai Chandrasekaran V M.
SASTRA University Vellore Institute of Technology, Vellore, INDIA
39 PUBLICATIONS   176 CITATIONS    128 PUBLICATIONS   240 CITATIONS   

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

QUEUEING THEORY View project

Analysis of Retrial queueing system with Working Vacations and Working Breakdowns View project

All content following this page was uploaded by Chandrasekaran V M. on 25 April 2018.

The user has requested enhancement of the downloaded file.

 International Journal of Applied Engineering Research, ISSN 0973-4562 Vol. 11 No.1 (2016)
© Research India Publications; http/www.ripublication.com/ijaer.htm

A single server retrial queue with Bernoulli working

vacation and vacation interruption
P. Rajadurai* M. C. Saravanarajan
Department of Mathematics, Department of Mathematics,
School of Advanced Sciences, School of Advanced Sciences,
VIT University, Vellore, Tamilnadu, India VIT University, Vellore, Tamilnadu, India
Email: psdurai17@gmail.com Email: mcsaravanarajan@vit.ac.in
*corresponding author

V. M. Chandrasekaran
Department of Mathematics,
School of Advanced Sciences,
VIT University, Vellore, Tamilnadu, India
Email: vmcsn@vit.ac.in

Abstract—In this investigation, we consider a single server
retrial queueing system with Bernoulli working vacation and
vacation interruption. When the orbit becomes empty at service
completion instant, the server goes for working vacation. In
working vacation period, the server works in lower service rate.
If there are customers in the orbit at lower rate service
completion instant, the server will come back to the normal busy
period. Meanwhile, at the end of each vacation, if there are no
customers in the system, the server is idle and ready for serving
new arrivals or it continuous the vacation. The probability
generating function for number of customers in the system is
obtained by using the supplementary variable method. Some
system performance measures and numerical examples are
presented.
Keywords—retrial queue; working vacations; vacation
interruption; ssupplementary variable technique.
I. INTRODUCTION
Queueing system is a powerful tool for modelling
communication networks, transportation networks, production
lines and operating systems. In recent years, computer
networks and data communication systems are the fastest
growing technologies, which have led to significant
development in applications such as swift advance in internet,
audio data traffic, video data traffic, etc. In retrial queueing
system, queues with repeated attempts are characterised by the
fact that an arriving customer finds the server busy upon
arrival is requested to leave the service area and join a trial
queue called orbit. After some time the customer in the orbit
can repeat their request for service. An arbitrary customer in
the orbit who repeats the request for service is independent of
the rest of the customers in the orbit. Such queues play a
special role in computer and telecommunication systems.
Gomez-Corral [8] analysed an M/G/1 retrial queue with
general retrial times, where in the customers who find the
server busy are queued in the orbit in accordance with first-
come first-served discipline. Such a situation arises in specific
communication protocols, retail shopping queues, etc. There
are plenty of literatures available on the retrial queues. We
referred the works of Falin and Templeton [5], Artalejo and
Corral [4] and Artalejo [3], etc.
In a vacation queueing system, during the working
vacation period (WV), the server serves to customer at lower
service rate, but the server stops the service completely during
the normal vacation period. This queueing system has major
applications in providing network service, web service, file
transfer service and mail service etc. In 2002, Servi and Finn
[14] introduced an M/M/1 queueing system with working
vacations. Wu and Takagi [15] extended the M/M/1/WV
queue to an M/G/1/WV queue. Rajadurai et al. ([11], [12])
studied a two phase queueing system with Bernoulli vacation
and multiple vacation policy. Very recently, Arivudainambi et
al. [2] introduced M/G/1 retrial queue with general retrial
times and single working vacation. Furthermore, during the
working vacation period, if there are customers at a service
completion instant, the server can stop the vacation and come
back to the regular busy state. This policy is called vacation
interruption. Some of the authors like, Zhang and Hou [16],
Zhang and Liu [17], Gao et al. [7] analyzed a single server
retrial queue with working vacations and vacation
interruptions. Recently, Gao and Liu [6] discussed a model
with M/G/1 queue with single working vacation and vacation
interruption under Bernoulli schedule. To the authors best of
knowledge, there are many works available in the concept of
different types of retrial queueing system with working
vacation by using the method of matrix geometry analysis, but
there is no work published in the queueing literature with the
combination of retrial queueing system with general retrial
times, single and multiple working vacations and vacation
interruption by using the method of supplementary variable
technique.
In this paper, we consider a generalization of the single
and multiple working vacation queueing models with concept
of retrial queues. The remainder of this paper is organized as

400
 International Journal of Applied Engineering Research, ISSN 0973-4562 Vol. 11 No.1 (2016)
© Research India Publications; http/www.ripublication.com/ijaer.htm
follows; the detailed mathematical description and practical
applications of this model are given in section 2. The steady
state joint distribution of the server state and the number of
customers in the orbit/system are obtained in section 3. Some
system performance measures are obtained in section 4.
Important special cases are discussed in section 5. In section 6,
the effects of various parameters on the system performance
are analyzed numerically. Summary of the work are presented
in section 7.
II. DESCRIPTION OF THE MODEL
In this section, we consider a single server retrial queueing
system with both single and multiple working vacations and
vacation interruption. The detailed description of model is
given as follows:
The arrival process: Customers arrive at the system according
to a Poisson process with rate.
The retrial process: We assume that there is no waiting space
and therefore if an arriving customer finds the server free, the
customer begins his service immediately, otherwise an
arriving customer finds the server busy or on working
vacation, the arrivals join pool of blocked customers called an
orbit in accordance with FCFS discipline. That is, only one
customer at the head of the orbit queue is allowed access to
the server. Inter-retrial times have an arbitrary
distribution R(t ) with corresponding Laplace Stieltijes
Transform (LST) R ( ).
The Bernoulli working vacation process: The server begins a
working vacation each time when the orbit becomes empty
and the vacation time follows an exponential distribution with
parameter θ. If any customer arrives in a vacation period, the
server continues to work at a lower speed service rate. The
working vacation period is an operational period at a lower
speed. If any customers in the orbit at a lower speed service
completion instant in the vacation period, the server will stop
the vacation and come back to the normal busy period which
means vacation interruption happens. Otherwise, if no
customers are in the system at the end of the vacation, the
server either joins the system and remains idle to serve a new
customer with probability p (single working vacation) to serve
the arriving customers in regular mode or leaves for another
working vacation with probability q  1  p (multiple working
vacation). When a vacation ends, if there are customers in the
orbit, the server switches to the normal working level. During
the working vacation period, the service time follows a
general random variable Sv with distribution function Sv (t ),
LST and the first and second moments are  (1) and  (2)
Sv* ( )
The regular service process: Whenever a new customer or
retry customer arrives at the server idle state, the server
immediately starts normal service for the arrivals. The service
time follows a general distribution. It is denoted by the
random variable Sb with distribution function Sb (t ) having
LST Sb* ( ).
401
We assume that inter-arrival times, retrial times, service
times and working vacation times are mutually independent of
each other.
III. STEADY STATE PROBABILITIES
In this section, we develop the steady state difference-
differential equations for the retrial queueing system by
treating the elapsed retrial times, the elapsed service times and
the elapsed working vacation times as supplementary
variables. Then we derive the probability generating function
(PGF) for the server states, the PGF for number of customers
in the system and orbit.
3.1. The steady state equations
In steady state, we assume that R(0)=0, R()=1, Sb(0) = 0,
Sb() = 1, Sv(0) = 0, Sv() = 1 are continuous at x = 0. So that
the function a( x), b ( x), and v ( x) are the conditional
completion rates for retrial, normal service and lower rate
service respectively.
dR( x) dSb ( x) dSv ( x)
i.e., a( x)dx  ; b ( x)dx  ; v ( x)dx  .
1  R( x) 1  Sb ( x) 1  Sv ( x)
In addition, let R0 (t ), Sb0 (t ) and Sv0 (t ) be the elapsed retrial time,
elapsed normal service time, elapsed working vacation time
and elapsed repair time respectively at time t.
Thus the supplementary variables R0 (t ), Sb0 (t ), Sv0 (t ) and G0 (t ) are
introduced in order to obtain a bivariate Markov
process C(t ), N (t ); t  0 , where C(t) denotes the server state
(0,1,2,3,4) depending on the server is free on both regular
busy period and working vacation period, regular busy, on
working vacation and under repair. If C(t) = 1 and N(t) > 0,
then R0 (t ) represent the elapsed retrial time, if C(t) = 2 and
N (t )  0 then Sb0 (t ) corresponding to the elapsed time of the
customer being served in regular busy period. If C(t) = 3 and
N (t )  0, then Sv0 (t ) corresponding to the elapsed time of the
customer being served in lower rate service period.
Let {tn; n = 1,2,...} be the sequence of epochs at
which either a normal service or working vacation period
completion occurs ends. The sequence of random vectors
Zn  C tn   , N tn   forms a Markov chain which is embedded in
the retrial queueing system. It follows that Zn ; n  N is ergodic
if and only if (1)  R ( ), for our system to be stable,
For the process N (t ), t  0 , we define the
probabilities Q0 (t )  P C(t )  0, N (t )  0 P0 (t )  P C(t )  1, N (t )  0 th
e probability densities for t  0, x  0 and n  0
 International Journal of Applied Engineering Research, ISSN 0973-4562 Vol. 11 No.1 (2016)
© Research India Publications; http/www.ripublication.com/ijaer.htm

Pn ( x, t )dx 
 P C (t )  1, N (t )  n, x  R 0 (t )  x  dx ,   
 b, n ( x, t )dx  P C (t )  2, N (t )  n, x  S (t )  x  dx ,
0
 
b,0 (0)  P1 ( x)a( x)dx   Qv,0 ( x)dx   P0  , n  0, (9)

 
b
0 0 
Qv , n ( x, t )dx  P C (t )  3, N (t )  n, x  S (t )  x  dx.
0
v     
 
b,n (0)   Pn 1 ( x)a( x)dx   Pn ( x)dx   Qv,n ( x)dx  , n  1, (10)
  
The following probabilities are used in sequent sections: 0 0 0 
Q0 (t ) is the probability that the system is idle at time t and the   Q , n  0
Qv,n (0)   0 (11)
server is in working vacation. P0 (t ) is the probability that the
0, n 1
system is idle at time t and the server is in regular busy period.
Pn ( x, t ) is the probability that at time t there are exactly n The normalizing condition is
customers in the orbit with the elapsed retrial time of the test      
customer undergoing retrial lying in between x and x+dx. P0  Q0   
n 0  0

Pn ( x)dx   b,n ( x)dx  Qv,n ( x)dx   1 (12)
 
b,n ( x, t) is the probability that at time t there are exactly n n 1 0 0 
customers in the orbit with the elapsed regular service time of
the test customer undergoing service lying in between x and 3.2. The steady state solutions of the model
x+dx. Qv,n ( x, t ) is the probability that at time t there are exactly The probability generating function technique is used here to
n customers in the orbit with the elapsed lower rate service obtain the steady state solution of the retrial queueing model.
time of the test customer undergoing service lying in between To solve the above equations, we define the generating
x and x+dx. functions for |z|  1, as follows:
  
We assume that the stability condition is fulfilled in the sequel
and so that we can set Q0  lim t 
Q0 (t ); P0  lim P0 (t ) and limiting
t 
P ( x, z )  
n 1
Pn ( x) z n ; P(0, z )  
n 1
Pn (0) z n ;  b ( x, z )  
n 0
b , n ( x) z
n
;

densities for t ≥ 0, x ≥ 0 and n ≥1.   

 b (0, z )    b, n (0) z n ; Qv ( x, z )   Qv, n ( x) z n ; Qv (0, z)  Q v , n (0) z
n
;
Pn ( x)  lim Pn ( x, t ); b,n ( x)  lim b,n ( x, t ) and Qv,n ( x)  lim Qv,n ( x, t ). n 0 n 0 n 0
t  t  t 
Multiplying the steady state equation and steady state
Following the routine procedure of the method of boundary condition (3) - (11) by zn and summing over n, (n =
supplementary variable technique, we obtain the following 0,1,2...)
system of equations that govern the dynamics of the system
behavior, P( x, z )
    a( x)  P( x, z )  0 (13)
x
 P0   pQ0 (1)
b ( x, z )
     (1  z )  b ( x)  b ( x, z )  0, (14)
x
     Q0   qQ0  
0
b,0 ( x) b ( x)dx   Q ( x) ( x)dx (2)
0
0 v Qv ( x, z )
   (1  z )    v ( x)  Qv ( x, z )  0 (15)
x
dPn ( x)
    a( x)  Pn ( x)  0, n  1 (3)  
dx P(0, z ) 
  
b ( x, z) b ( x)dx  Qv ( x, z) v ( x)dx       Q0   qP0 (16) 
d b,0 ( x)
    b ( x)  b,0 ( x)  0, n  0,
0 0
(4)
dx Qv (0, z)  Q0 (17)
d  b , n ( x)   
    b ( x)  b,n ( x)  b,n 1 ( x), n  1, (5)
  
1
b (0, z )  P( x, z )a( x)dx   P( x, z) dx   Qv ( x, z) dx, (18)
dx z
0 0 0
dQv,0 ( x)
      v ( x)  Qv,0 ( x)  0, n  0 (6) Solving the partial differential equations (13)-(18), it follows
dx that
dQv,n ( x)
      v ( x)  Qv,n ( x)  Qv,n 1 ( x), n  1 (7)
dx P( x, z)  P(0, z)[1  R( x)]e x (19)
 Ab ( z ) x
b ( x, z)  b (0, z)[1  Sb ( x)]e , (20)
The steady state boundary conditions at x = 0 are  Av ( z ) x
Qv ( x, z)  Qv (0, z)[1  Sv ( x)]e , (21)
  where Ab ( z)   (1  z) and Av ( z)     (1  z) 

0

Pn (0)  b,n ( x) b ( x)dx  Qv,n ( x) v ( x)dx, n  1
0
(8)
Inserting equation (19)-(21) in (17) and make some
manipulation, finally we get,

402
 International Journal of Applied Engineering Research, ISSN 0973-4562 Vol. 11 No.1 (2016)
© Research India Publications; http/www.ripublication.com/ijaer.htm

 p  R ( )  1 
b (0, z) 
P(0, z)  
z 
 
R ( )  z 1  R ( )    P0  Q0V ( z) (22) P0  (30)

     1  Sv* ( )   R ( ) 1   p     1Sv* ( ) 
 1  Sv*  Av ( z )  Ab ( z)    (1  z)  and Av ( z)     (1  z) 
where V ( z ) 
   (1  z )  
Using (20)-(21) in (16), we get Theorem 3.2. Under the stability condition (1)  R ( ),
probability generating function of number of customers in the
P(0, z)  b (0, z)Sb*  Ab ( z)   Qv (0, z)Sv*  Av ( z)      p  Q0 (23) system and orbit size distribution at stationary point of time is

Using (19)-(23) in (16), we get Nrs ( z )

Ks ( z)   P0  Q0  P( z )  z  ( z )  Q( z )  (31)
Drs ( z )
Nr ( z )
P(0, z ) 
Dr ( z )
(24) 
    
       zV ( z )    p z  R ( )  z (1  R ( )) S *  A ( z )  
b b 



   
  
1 z 
   
Nr ( z )  zQ0  Sv*  Av ( z )   1   p   V ( z )   p  Sb*  Ab ( z )   

Nrs ( z )  Q0 

  
 z 1  R ( )  V ( z )   p  Sb  Ab ( z )    Sv  Av ( z )   1   p 

* * *






 
Dr ( z )  z  R ( )  z (1  R ( )) Sb*  Ab ( z )   

  
z 1  S *
b  Ab ( z  
)   S *
v  Av ( z )   
 1   p R 
(  )  z (1  R 
(  
))  z  V ( z )  p  


Using the equation (19), (21) and (24) in (17), we get  

Drs ( z)  Ab ( z)  z  R ( )  z(1  R ( )) Sb*  Ab ( z)   
b (0, z )  Q0 
v v 
  S *  A ( z)  1   p
  
 
 Dr ( z ) (25)
Ko ( z ) 
Nro ( z )
 P0  Q0  P( z )  ( z )  Q( z ) (32)
 
Drs ( z )
 R ( )  z (1  R ( ))  z  V ( z )   p 
 
  
     b 
      V ( z )    p z  R ( )  z (1  R ( )) S *  A ( z ) 
b

  

1  z   
  

Using (18) and (24)-(25) in (19)-(21), then the limiting
probability generating functions P( x, z), b ( x, z), Qv ( x, z) and

Nro ( z )  Q0 

 *

*
 
 z 1  R ( )  V ( z )   p  Sb  Ab ( z )    Sv  Av ( z )   1   p 
*




 
R( x, z ). Next we are interested in investigating the marginal

     
 1  Sb  Ab ( z )   Sv  Av ( z )   1   p R ( )  z (1  R ( ))  z  V ( z )   p 
* *  
 

orbit size distributions due to system state of the server.
where Q0 is given in Eq. (29).
Theorem 3.1. Under the stability condition (1)  R ( ), the
stationary joint distributions of the number of customers in the IV. SYSTEM PERFORMANCE MEASURES OF THE MODEL
orbit when server being idle, busy, on working vacation and In this section, we derive some interesting system
under repair is given by probabilities when the system in different states and system

performance measures of the model. The probabilities of the
 P(x, z)dx  Dr(z)
Nr ( z )
P( z )  server states are as follows in theorem 4.1.
0

(26) Theorem 4.1. If the system satisfies the stability condition

 1  R * ( ) 
Nr ( z )  zQ0 
  
   
  Sv  Av ( z )   1   p   V ( z )   p  Sb  Ab ( z ) 
* *
  (1)  R ( ), then we get the following probabilities,

  
Dr ( z )  z  R ( )  z (1  R ( )) Sb*  Ab ( z )   (i) Let P be the steady state probability that the server is idle
during the retrial



 b ( z )   b ( x, z )dx    
     1  S * ( )   1  S * ( )   p 
    
 

v v (1)
P  Q0 1  R ( )  
0
 R ( )  (1) 
   
(27)

 
Q0 1  Sb*  Ab ( z )   z  V ( z )   p    Sv  Av ( z )   1   p
*
 
 (ii) Let Πb be the steady-state probability that the server is
 
 
Ab ( z )  Dr ( z )  R ( )  z (1  R ( ))
 

busy,



Qv ( z )  Qv ( x, z )dx  Q0V ( z )   (28)   
  2  1  S * ( )  R ( )  1  S * ( )   p

 b  Q0 (1)  
v v    
0
 R ( )  (1) 
Applying the normalizing condition  
P0  Q0  P(1)  (1)  Q(1)  R(1)  1, we get, (iii) Let Qv be the steady state probability that the server is on
working vacation

Q0 
R ( )  1
(29)
 
Qv  Q0 1  Sv* ( )   

    1  Sv* ( )   R ( ) 1   p    1Sv* ( ) 

403
 International Journal of Applied Engineering Research, ISSN 0973-4562 Vol. 11 No.1 (2016)
© Research India Publications; http/www.ripublication.com/ijaer.htm

Proof. Noting that P  lim P( z), b  lim b ( z) and Qv  lim Qv ( z).

z1 z1

The stated formula follows by direct calculation.

z1

 
1  z  
 
 z  R ( )  z (1  R ( )) S * A ( z )
b b  
  V ( z)    1  
 





   
 z 1  R* ( )  Sv*  Av ( z )   V ( z ) Sb*  Ab ( z )   1  
  


   
4.1. Mean queue length   * 
 1  Sb  Ab ( z )   Sv  Av ( z )   1 R ( )  z (1  R ( ))  zV ( z )  
*  

K s ( z )  P0  
If the system is in steady state condition,
(i) The excepted number of customers in the orbit (Lq) is
 
1  z  z  R ( )  z(1  R ( )) Sb*  Ab ( z)   
obtained by differentiating (32) with respect to z and This coincides with the result of Gao et al. [7].
evaluating at z = 1
   Case 2: No vacation interruption and Single working vacation
d Nr (1) Drq(1)  Drq(1) Nrq(1)  Let p = 1, θ → 0, our model can be reduced to M/G/1
Lq  K o (1)  lim K o ( z )  Q0  q
 
 
z 1 dz 2
3 Drq(1) retrial queue with single working vacation.
 
 v
Ks ( z)  

 S * ( ) R ( )   (1) 


Nrq(1)   2    2
    1      R ()      pR ()
1  Sv ( ) (1)

(1)



  E ( S v )  R (  ) S v ( ) 
*


Nr (1)  3     1  S ( )    S ( )   3    1  S ( ) 

q
2 
v

v
2 
v


  *
   *  *
 
  Sv     z   1 R ( )  z (1  R ( ))  1  z  R ( ) Sv ( )  Sb     z  
 



   2  2 1  R ()   6   V (1)
2
(2) (1)
 2 

  
Sv* ( ) z  R ( )  z (1  R ( )) Sb*     z  

 6  V (1) 1  R (  )    R (  ) S ( ) 
(1)
 2  
v
This coincides with the result of Arivudainambi et al. [2].

Dr (1)  2  R ( )   
q

(1) Case 3: No retrial and Multiple working vacation
Dr (1)  3     2 1  R ( )  
q
2
(2) (1)
 Let p = 0; R ( ) →1, suppose that there is no retrial time
in the system then we get an M/G/1 queue with working

 
vacations and vacation interruption.

   2 (2)  2(1) 1  R ( ) ; V (1) 



1  Sv ( )   Sv ( ) ;     
 1  z  z  S * A (z)
b b     zV ( z)    1 
where 
1    
(1)


Sv* ( )  xe x dSv ( x);
Ks ( z)     
 z 1  Sb*  Ab ( z )   Sv*  Av ( z )   zV ( z )  1 

0
(ii) The excepted number of customers in the system (Ls) is 1      1  Sv* ( )    (1) Sv* ( )  1  z   z  S  A ( z)
*
b b

obtained by differentiating (31) with respect to z and This coincides with the result of Zhang and Hou [16].
evaluating at z = 1
 
VI. NUMERICAL ILLUSTRATION
d  Nrs(1) Drq(1)  Drq(1) Nrq(1) 
Ls  K s (1)  lim K s ( z )  Q0   In this section, we present some numerical examples
 
z 1 dz 2
 3 Drq(1)  using MATLAB in order to illustrate the effect of various
 


where Nrs(1)  Nrq(1)  6 R ( ) 1  Sv ( )
(iii) The average time a customer spends in the system (Ws)
and the average time a customer spends in the queue (Wq) are
found by using the Little‟s formula Ws  Ls and Wq  Lq
V. SPECIAL CASES
In this section, we analyze briefly some special cases of
our model, which are consistent with the existing literature.
Case 1: Multiple working vacations
Let p = 0, our model can be reduced to a single server
retrial queueing system with working vacations. In this case,
Ks(z) can be simplified to the following expression.
          p
parameters in the system performance measures. We consider
(1) (1) retrial times, service times, working vacation times and repair
times are exponentially, Erlangianly and hyper-exponentially
distributed. The arbitrary values to the parameters are so
chosen such that they satisfy the stability condition. The
following tables give the computed values of various
characteristics of our model like, probability that the server is
idle on working vacation (P0), the mean orbit size (Lq),
probability that server is idle during retrial rime (P) and
working vacation (Qv) respectively. The exponential
distribution is f ( x)  e x , x  0 , Erlang–2 stage distribution
is f ( x)   2 xe x , x  0 and hyper-exponential distribution
 x 2  2 x
is f ( x)  ce  (1 c) e , x  0.
Table 1 shows that when retrial rate (a) increases, then the
probability that server is idle (P0) increases, the mean orbit
size (Lq) decreases and probability that server is idle during
retrial time (P) also decreases for the values of =1; θ=2; µ=9;
p=0.7; µv=4; c=0.7. Table 2 shows that when vacation rate (θ)
increases, the probability that server is idle (P0) increases, then
the mean orbit size (Lq) decreases and probability that server is

404
 International Journal of Applied Engineering Research, ISSN 0973-4562 Vol. 11 No.1 (2016)
© Research India Publications; http/www.ripublication.com/ijaer.htm
under working vacation (Qv) also decrease for the values of
=1; µ=9; p=0.7; a=2; µv=4; c=0.7.
For the effect of the parameters λ, a, p, θ, μb, and μv on the
system performance measures, three dimensional graphs are
illustrated in Figure 1 – Figure 3. In figure 1, we examine the
behavior of the probability that server is idle (P0) increases for
increasing the value of the lower service rate (μv) and regular
service rate (μb). Figure 2 shows that the probability that
server is idle (P0) increases for increasing the value of idle
probability (p) and lower speed service rate (μv). In figure 3,
we examine the behavior of the mean orbit size (Lq) decreases
for increasing the value of lower speed service rate (μv) and
retrial rate (a).
From the above numerical examples, we can find the
influence of parameters on the performance measures in the
system and know that the results are coincident with the
practical situations.
VII. CONCLUSION
In this work, we have studied a single server retrial
queueing system with Bernoulli working vacation and
vacation interruption. The analytical results which are
validated with the help of numerical illustrations may be
useful in various real life situations to design the outputs. The
probability generating functions for the numbers of customers
in the system when it is free, busy and on working vacation
are found by using the supplementary variable technique.
Some important system performance measures are obtained.
The explicit expressions for the average queue length of orbit
and system have been obtained. This model finds practical real
life application in Simple Mail Transfer Protocol (SMTP) mail
system uses to deliver the messages between mail servers and
telephone consultation of medical service systems. The
novelty of this investigation presents, a generalization of both
single and multiple working vacation models in presence of
retrial queues.
References
[1] A. Aissani, (2008) Optimal control of an M/G/1 retrial queue with
vacations. J Syst Sci Eng Vol. 17, No. 4, pp. 487–502
Figure 1. P0 versus μv and μb
405
[2] Arivudainambi, D., Godhandaraman, P. and Rajadurai, P. (2014)
„Performance analysis of a single server retrial queue with working
vacation‟, OPSEARCH, Vol. 51, No. 3, pp. 434–462.
[3] Artalejo, J.R. (2010) Accessible bibliography on retrial queues: progress
in 2000–2009. Math Comput Modell Vol. 51, pp. 1071–81.
[4] Artalejo, J. and Corral, A.G. (2008) Retrial Queueing Systems, Springer,
Berlin, Germany.
[5] Falin, G.I. and Templeton, J.G.C. (1997) Retrial queues. London:
Chapman & Hall.
[6] Gao, S. and Liu, Z. (2013) „An M/G/1 queue with single working
vacation and vacation interruption under Bernoulli schedule‟, Applied
Mathematical Modelling, Vol. 37, No. 3, pp.1564–1579.
[7] Gao, S., Wang, J. and Li, W. (2014) „An M/G/1 retrial queue with
general retrial times, working vacations and vacation interruption‟, Asia-
Pacific Journal of Operational Research, Vol. 31, No. 2, pp. 1440006–
14400031.
[8] Gomez-Corral, A. (1999) „Stochastic analysis of a single server retrial
queue with general retrial times‟, Naval Res. Logist., Vol. 46, No. 5,
pp.561–581.
[9] Ke, J.C., Wu, C.U. and Zhang, Z.G. (2010) „Recent developments in
vacation models: a short survey‟, International Journal of Operational
Research, Vol. 7, No. 4, pp.3–8.
[10] Pakes, A.G. (1969) „Some conditions for ergodicity and recurrence of
Markov chains‟, Operations Research, Vol. 17, No. 6, pp. 1058–1061.
[11] Rajadurai, P., Saravanarajan, M.C. and Chandrasekaran, V.M. (2014)
„Analysis of an M[X] /(G1,G2)/1 retrial queueing system with balking,
optional re-service under modified vacation policy and service
interruption‟, Ain Shams Engineering Journal, Vol. 5, No. 3, pp.935–
950.
[12] Rajadurai, P., Varalakshmi, M., Saravanarajan, M.C. and
Chandrasekaran, V.M. (2015) „Analysis of M[X] /G/1 retrial queue with
two phase service under Bernoulli vacation schedule and random
breakdown‟, Int. J. Mathematics in Operational Research, Vol. 7, No. 1,
pp.19–41.
[13] Sennott, L.I., Humblet, P.A. and Tweedi, R.L. (1983) „Mean drifts and
the non ergodicity of Markov chains‟, Operation Research, Vol. 31, No.
4, pp.783–789.
[14] Servi, L.D. and Finn, S.G. (2002) „M/M/1 queues with working
vacations‟, Performance Evaluation, Vol. 50, No. 1, pp.41–52.
[15] Wu, D. and Takagi, H. (2006) „M/G/1 queue with multiple working
vacations‟, Performance Evaluation, Vol. 63, No. 7, pp.654–681.
[16] Zhang, M. and Hou, Z. (2012) „M/G/1 queue with single working
vacation‟, Journal of Appl. Math. Comput., Vol. 39, Nos. 1–2, pp.221–
234.
[17] Zhang, M. and Liu, Q. 2014, “An M/G/1 G-queue with server
breakdown, working vacations and vacation interruption”, OPSEARCH,
DOI10.1007/s12597-0140183-4.
Figure 2. P0 versus μv and p
 International Journal of Applied Engineering Research, ISSN 0973-4562 Vol. 11 No.1 (2016)
© Research India Publications; http/www.ripublication.com/ijaer.htm

Figure 3. Lq versus μv and a

Table 1. The effect of retrial rate (a) on P0, Lq and P

Retrial
Exponential Erlang-2 stage Hyper-Exponential
distribution
a P0 Lq P P0 Lq P P0 Lq P
2.00 0.4583 0.3400 0.0715 0.2394 0.7152 0.3276 0.4103 0.4323 0.1187
3.00 0.4715 0.2269 0.0479 0.3033 0.4580 0.2100 0.4322 0.2913 0.0794
4.00 0.4782 0.1699 0.0361 0.3337 0.3438 0.1540 0.4432 0.2207 0.0596
5.00 0.4822 0.1356 0.0289 0.3514 0.2791 0.1215 0.4498 0.1783 0.0477

Table 2. The effect of vacation rate (θ) on P0, Lq and Qv

Vacation
Exponential Erlang-2 stage Hyper-Exponential
distribution
θ P0 Lq Qv P0 Lq Qv P0 Lq Qv
1.00 0.5421 0.0561 0.0282 0.4355 0.1140 0.0416 0.5163 0.0777 0.0336
2.00 0.6708 0.0558 0.0150 0.5381 0.0992 0.0206 0.6390 0.0720 0.0173
3.00 0.7285 0.0524 0.0095 0.5845 0.0845 0.0124 0.6940 0.0650 0.0107
4.00 0.7612 0.0487 0.0066 0.6111 0.0730 0.0083 0.7253 0.0589 0.0073

406

View publication stats