International Journal of Recent Technology and Engineering
(IJRTE) ISSN: 2277-3878, Volume-8 Issue-4, November 2019
Effects of Catastrophe on a Queueing
System with Voice over Internet Protocol
M.Balasubramanian, Abel Thangaraja.G, Bharathidass.S

Abstract: Consider a retrial queue with VoIP calls and two
kinds of heterogeneous services such as essential and optional
services. The multiple vacation policy, retrial policy, customer’s
impatience and the concept of catastrophe are adopted to derive
the required solutions. The steady state system size distribution
and probability generating function under different level have
been obtained. Based on some assumptions, special and
particular cases are discussed.
Keywords: VoIP, Catastrophe, Impatience, Optional service,
Vacation and Retrial policies.
I. INTRODUCTION
The concepts of queueing theory have been applied in
various fields like phone systems, communication network
systems, computer systems, industrial sectors and so on. The
techniques adopted in the queueing models produce
remarkable solutions. In this paper, Voice and Internet
Protocol (VoIP), Vacation policies, Catastrophe, retrial
queue, optional service and impatience have been utilized in
proper place. Generally, in any queueing models, the
arriving units are considered as human beings, but, here,
VoIP calls are taken as arriving units.
Voice over IP (VoIP) is a typical method for the
delivering voice communications and multimedia sessions
through Internet Protocol (IP) networks. VoIP is a toll-free
long distance voice, fax calls on IP data networks other than
public switched telephone network(PSTN). It saves the long
distance costs between two or more locations. Earlier people
depend on the PSTN for communicating voice. The
connection is dedicated to only two parties between two
locations when the call is made. Although there is an
availability of many bandwidth, none of the information can
pass over the call. Internet Protocol and internet and
broadband telephone and broadband telephone services are
generally associated with VoIP. The principles of VoIP
telephone calls are same as digital telephone calls. The
digital information is gathered and transmitted as IP packets.
VoIP services begins with providing solutions for the
business and technical problems. In the second generation
era, like Skype with closed networks offered free calls. The
federated VoIP concept was adopted in the Google Talk, a
Revised Manuscript Received on November 19,
M.Balasubramanian, Assistant Professor, Department of Statistics,
Periyar E.V.R. College (Autonomous), Bharathidasan University(
Affiliation), Tiruchy, Tamilnadu, India.
Abel Thangaraja.G, Assistant Professor and Head of the Computer
Science, KayPeeYes College of Arts and Science, Kotagiri, Tamilnadu,
India.
Bharathidass.S, Assistant Professor, Department of Statistics, Periyar
E.V.R. College (Autonomous), Bharathidasan University( Affiliation),
Tiruchy, Tamilnadu, India.
Retrieval Number: D5289118419/2019©BEIESP
DOI:10.35940/ijrte.D5289.118419
third generation service providers. All these solutions
provide a dynamic interconnection between the users on the
internet.
VoIP systems transmit audio streams over IP networks
with media delivery protocols. Some of the popular codecs
are µ-law and a α-law versions of G.711, G.722, an open
source voice codec known as iLBC, and others. Recently,
with the rapid usage of IP, a low cost transport mechanism
which can be used for both voice and data. Making use of
the IP infrastructure and hardware the voice traffic on top of
the data network.
The arriving calls are served by a one server in two non-
homogeneous modes such as the first one is essential but the
second is optional. If the server is busy either with essential
or with optional service, the arriving call balks from the
system or enters into an orbit to make trials to get desired
service. After end of a service of a call, if there is no arrival
in the system, the server avails vacation.
Vacation models of server‟s are applicable for the systems in
which the server wants to utilize the idle time for various
purposes. Vacation of the server is one of the concepts of
queueing theory and that leads to study new results. After the
completion of service, if the queue is empty, the server leaves
and engages other work but notice the new arrivals to the
system. The period of unavailable of the server in the counter is
known as vacation period. On returning from vacation, if there
were units in the system the server do the service otherwise he
avails another vacation. These type of vacations are called
single and multiple vacations.
In communication networks, the system may failure due to
various factors, in particular, the occurrence of catastrophe is
one of the factors. The concept of catastrophe has played a vital
role in the areas of Science and Technology. It occurs at
random leading to extinction of all the units and activate the
service facility until a new arrival is not unusual in most of the
real life situations. The catastrophe may exists from outside or
within the system. In computer based systems, if a task is
infected, this infected task may transfer the virus to the other
processers. These infected network of tasks may be imitated by
the catastrophes which leads to construct queueing models with
catastrophes.
II. REVIEW OF LITERATURE
2019 Falin and Templeton (1997) have summarized many
contributions relating to the queueing systems with retrial
queues. Artalejo and Choudhury (2004) have used
Published By:
Blue Eyes Intelligence Engineering
7301 & Sciences Publication
 Effects of Catastrophe on a Queueing System with Voice over Internet Protocol
embedded Markov chain of retrial queues consisting of
services with two phases. Also they derived steady state
solution, average number of customers and other related
measures.
Doshi (1985) has discussed the system with infinite
number of vacation types. After completing all the services
to customers, the server avails a type-1 vacation. Coming
back from type-1 vacation, if there are no customers, the
server starts a type-2 vacation and so on. Choudhury and
Madhuchanda (2004) have dealt with a queueing system of
bulk arrival with heterogeneous services which are governed
by a single server. They derived the solution for the
stationary queue size distribution, waiting time distribution
and related performance measures. Armuganathan et al.,
(2008) have analysed steady state solutions of a bulk size
system of non-Markovian queue with N-policy and various
types of vacation.
Senthilkumar & Arumuganathan (2009) have analysed
the retrial queue with impatient subscribers under steady
state conditions and heterogeneous services of two phases
and distinct vacation policies. Voice over IP calls are taken
as arrival units. The average number of customers, averge
waiting duration in retrial queue and some particular cases
have been analysed. Jeyakumar and Arumuganathan
(2011) have analysed a single server non- Markovian queue
with more than one vacations and re-service as optional of
the steady state conditions. They mathematically derived the
mean queue size, busy period, idle period and cost function
and obtained numerical results. Ponnammal et al., (2013)
have considered a customer‟s arrival follow Hyper Poisson
distribution and two types of services. The principles of
balking, reneging and impatience are applied to estimate
mean queue length for different positions of the server.
Swaminathan et al., (2015) have studied two independent
servers Markovian queue with blocking and catastrophes. It
is assumed that there is no waiting time for customers. The
steady state probabilities, expected queue length and
probability of lost customers have been derived.
Jain and Bura (2010) have analysed the effect of
catastrophe intensity of Markovian queue with restoration
for a single server with finite capacity. The intensity of
catastrophes follows uniform distribution. The steady state
probabilities, the expected number of units in both queue
and system were derived. Sudhesh (2010) has studied
transient probes for single server Markovian queue by using
the concepts of balking, reneging and catastrophe.
Dhanesh Garg (2013) has discussed Markovian queue of a
single server with finite capacity through catastrophe and
restoration. He has derived the p.g.f. for the number of times
the system reaches its capacity and the number of units in the
systems. The corresponding expected values have been
obtained. Ayyappan et al (2013) have analysed the effect of
catastrophe in an M/M/I queue when the server is idle and
busy. The probabilities under steady state conditons, average
length of a queue and the variance have been explicitly derived.
The derived results are justified by using the numerical values.
Arul and Vidhya (2014) have discussed a Markovian queue of
multi-server with system disaster and impatient customers.
They have derived transient probes of the model and justified
some special cases. Balasubramanian et al., (2015) have
studied a single server
Retrieval Number: D5289118419/2019©BEIESP
DOI:10.35940/ijrte.D5289.118419
bulk service Markovian queue with system disaster. The
expressions for the average number of times the system
reaches to the capacity, the average number of customers in
the system and their respective factorial moments have been
derived under different conditions.
III. DESCRIPTION AND ASSUMPTION
OF MODEL
In this study a queue of single server with the VoIP calls is
considered. Here the arrival times of the calls were assumed to
follow Poisson distribution with mean arrival rate of „λ‟. The
calls which were arrived may balk due to impatience or make
retrial to receive service again. The server has two services of
heterogeneous types in which the first one is essential for all
calls and second one is optional For both the services the times
of service were assumed to have general
distributions with probability density functions s1 ( x) and
s2 ( x) respectively.
If a call, on arrival, sees the server busy, it balks the system
with probability (1 ) or it enters into an orbit with
probability α in order to enter the system again. The time
gap between successive try of every call follows exponential
distribution with mean retrial rate „γ‟.
At the time of completion of a service of a call, if there is
no call in the system, the server goes for
j th ( j 1, 2,..., M) vacation with probability  j or retains
M
in the system with probability 0 and  j 1.
j 0
When the system is functioning well, unfortunately, the
catastrophe occurs either during the essential or optional
service and the system becomes down at once. The time at
which catastrophe occurs is exponentially distributed with
mean catastrophe rate  . After recovered from the system is
down, the process of the system is going on.
For the above stated model, form a two dimensional
Markov chain as N (t ), C (t).
Here, N (t )  n,(n  0) is the no. of calls at time „t‟
and C (t)  0,1, 2,3 are the states of the server.
Let Pi, n (t), (i=0,1,2,3; n=0,1,2,3,...) be the
probability of the system with n( 0) calls at time t, when,
the server is idle, on essential service, on optional service
and on vacation for i  0,1, 2,3.
IV. EQUATIONS RELATED TO STEADY
STATE OF THE MODEL
On the basis of the above section, the required steady-
state equations are framed.
Published By:
Blue Eyes Intelligence Engineering
7302 & Sciences Publication
 International Journal of Recent Technology and Engineering
(IJRTE) ISSN: 2277-3878, Volume-8 Issue-4, November 2019

(1)  
0 =  (  +n   ) P0, n  P3, n (0)   0 P2,n (0)   M
D (u )  S1 (     u ) S (     u )   0   jV j* (    u)
* *
2
 j 1 
 d P (x )  (    ) P (x )   P s (x )  ( n  1) P s (x )   P (x)
dx 1, n 1, n 0, n 1 0, n 1 1 1, n1
(2) Now, apply the expression for P ( z, 0) from equation
1

 d P (x )  (    ) P (x )   P (x )  P (x ) s (x)
(14) in the equation (11) which implies
(       z ) P (z , )   P (z )   P (z ) . S (     z ) S ( )
* ' * *
dx 2, n 2, n 1
(3) (19)
2, n 1, n 2
1  0 0 1 1 

M
Similarly, using the expressions (15) and (16) in the
P3, n (x )  (    ) P3, n (x )   P3, n 1 (x )  P2,n (0) j vk (x)
d

dx
(4) equations (12) and (13) which provide respectively as
j 1

Define Laplace Stieltjes Transform as 2 1  2 2 

(       z ) P* ( z , )  P ( z , 0) S * (     z )  S*( )
LST P (x)  P (), i=1,2,3
* (20)
and (5)
i,n  i ,n (       z ) P* ( z , )  P ( z , 0) 3 2
M

 V * (     z ) 
jj
M

 V*() jj


(21)
Apply the LST in the equations (2), (3) and (4) and using  j 1 j 1 

the relation (5), we have, In this stage, define the probability generation function as

 P1,*n ( )  P1, n (0)  (    ) P1,*n ( )   P0, n ( ) s1* ( )  ( n  1) P0, n 1 ( ) s1* ( )   P1, n1 ( ) (6)

Pi ( z ,0)  Pi*,n (0) zn ,

*
 P2,* n ( )  P2, n (0)  (    ) P2,* n ( )   P2,* n1 ( )  P1,n (0) s2* ( ) (7)
i = 1,2,3.
n0
M Now, using the relation (22) in the equations (19), (20) and
P () P (0)  V*()
*
(0)  ( )P ()P ( ) P
* *
 (8)
3, n 3, n 3, n 1 2,n j j j 1
(21) and they become respectively as

 P ( z )   P ' ( z ) . S * (     z) 1
V. PROBABILITY GENERATING FUNCTIONS P* (z, 0)  0 0
( z    )
 1 
(23)
1

Now, define probability generating functions. '

S * (     z ) S (     z )  1  P (z )   P (z)
*

P* (z, 0)  1  2  0 0  (24)
2
( z    )
and


P ( z ) P z
n
n 0

 0 (z
 P 0
) P
'
(z )S1
*
(     z )S 2 (     z )  
* M *  (25)
j j (     z ) 1 
 V

0 0, n 

 P* (z, 0)   j 1 
  3
P ( z , 0) 
i i,n
P (0) z ,
n
i = 1,2,3.,  (9) ( z    )

and 
The p.g.f. P(z) of the number of calls at any interval is stated

n 0 
P ( z, ) 
*
 P
*
( ) z ,
n
i = 1,2,3. 

as
i  i,n 
n 0 
P(z )  P (z )  P* (z ,0)  P* (z ,0)  P* (z,0)
Multiply the equations (1), (6), (7) and (8) by the proper 0 1 2 3
powers of z and making use of the p.g.f given in (9) and we
get, Substitute the equations (23) , (24) and (25) in the
(   ) P0 (z )   zP0' (z )  P3 (z , 0)   0 P2 (z, 0)   (1 z)1 (10) condition (26) and get,
 
(K ( z) 1)
1
(11) P (z)  ( z     )(z  D (z )  (  z     )(K (z )  1)P0 (z )   (1  z )
(27)
(       z ) P* (z,  )  P ( z , 0)   P ( z ) S * ( )  P1 (z)S* () ( z     )(z  D (z)
1 1 0 1 0 1
where
(       z ) P* (z,  )  P ( z, 0)  P (z, 0)S* () (12)  M 
D(z)=S1 (     z ).S 2 (     z ).   0   jV j (     z)
* * *
2 2 1
M
2
(13)  j 1 
(       z ) P (z,  )  P ( z , 0)  P ( z , 0)   V ()
* *
and
 M
3 3 2 j j

j 1 
K(z)=S1 (     z ).S 2 (     z ).   jV j (     z)
, i=1,2,3,…; Consider
* * *

In order to estimate Pi ( z, 0)  j 1 
VI. SPECIAL CASES & RESULTS
       z and substitute it in the equations (11),
(12) and (13) which yield 1. Erlangian Vacation time:
P ( z , 0)   P ( z ) S (     z )   P ( z )S (   z) (14)
* ' *
In this case, vacation times are distributed according to
1 0 1 0 1
Erlang distribution with „k‟ phases.
P (z ,0)  P (z ,0).S (    z) *
(15)
2 1 2 The pd.f. of k-Erlang is kv x
and k k 1  j
(kv j ) x e
v j (x) 
M
, j=1,2,3,...,M
P3 ( z , 0)  P2 ( z , 0). jV j (     z) (16) (k 1)!
*
j 1
Its Laplace Stieltjes Transform is
Substitute the expressions for P2 ( z, 0) and P3 ( z, 0) from
 k
the equations (15) and (16) in the expression (10) and get, kv j
V (     z)  
x
(17) j
 kv       z 

j 
M

[  S1 (     z ) S 2 (     z ){ 0  
* *
 jV j* (     z )}  (   )] P0 ( z)   (1  z) 1

P ' ( z)  j 1
M

[ z   S1 (     z ) S 2 (     z ){ 0   jV j* (     z)}
o

* *
j 1

Using the method of solving linear differential equation in On considering the vacation times follow Erlang
distribution, the p.g.f. of the number of calls P(z) shown in
the equation (17) which gives
(27), after applying the equation (29), becomes
  D (u )  (    )   (1 u )1   D (u)  (  )  
P0 (z )  exp   du  .  P0 (1)  
.exp
  du du (18)
  D (u )   u   u   D (u )   D (u )  u  
Where
Published By:
Retrieval Number: D5289118419/2019©BEIESP Blue Eyes Intelligence Engineering
DOI:10.35940/ijrte.D5289.118419 7303 & Sciences Publication
 Effects of Catastrophe on a Queueing System with Voice over Internet Protocol
( z   )(z  Dv (z))  (z   )(Kv (z) 1)P0 (z) (1-z) (Kv (z) 1) 2. No optional service and no catastrophe in the system:
 1 
P (z)   (30)
( z     )(z  Dv (z)) In this case, the arriving calls demand only essential
where service but no one opted second service with the absence of
 M j   k  catastrophe.
Dv ( z )  S 1* (     z ) S 2* (      z )   0 
kv j 


   

 
 j 1  kV j       z  
  In this regard, it is assumed that
and k   0 and S* (   z) 1. On assuming these
 M  2
 kv j 

* * 
K v ( z )  S1 (     z ) S 2 (     z )  j    values, the probability generating function (27) becomes

 

 j 1  kv j       z 

 
1
P ( z )   ( z  D2 ( z))  ( z  D2 ( z )) K 2 ( z ) 1P0 ( z)
It is noted that the equation (18) is re-written for P0 ( z), where
(37)

after replacing D(u) by D (u). D2 ( z )  S 1

* (   z ) 
0
*


 jV j (    z) 
M

v  j 1 


2. Erlangian Essential Service time: K 2
( z )  S * (   z )
1
M

 V * (   z)
jj 

 j 1 
Essential and optional service times follow Erlang with and
parameters
( k,  )  and exponential with parameter

  z
1
D2 (u) 1
D2 (u )  u
 

1 2 P0 ( z)  P0 (1) exp  du 

respectively. The probability density function of Erlang The derived result (37) is the result of Falin and Templeton
(1997).
( k, 1 ) for essential service is
k 1 k  1x 3. No optional service, single vacation, no balking and no
( k 1 ) x
k

s1 ( x)  e
(31)
(k 1)! catastrophe in the system.
Its Laplace Stieltjes Transform is
The arriving calls demand only essential service and due to
*  k 1 k impatience, the calls do not balk but surely (certainty) enter
S1 (      z)   , k>0, 1  0 (32)

 k 1       z  into an orbit for retrial. The server adopts only single vacation
Similarly, the p.d.f. of Exponential 2 for optional service and the occurrence of catastrophe is not permitted. For this
is, case,
S
we
2 (   z )  1, M =1,  =1 and   0 .
consider
s (x )   e x ,  2  0 2 2
2 (33) *
and its Laplace Stieltjes Transform is
2
Based on these above values, the p.g.f. of the number of
S*2 (     z)  (34)
 2       z calls P(z) is reduced from (27) we get,
Now apply the expressions (32) and (34) in the equation (27) P (z)  z  S1* (   z ) 0   1V1*
 z   0 S1* (   z ) 1 Po ( z) (  z ) 
(38)
 

and get
where
(  z     )( z  Ds ( z ))  (  z     )( K s ( z )  1)P0 ( z )  (1-z) ( K s ( z) 1)
1

P (z) 
 

  D (u) 1
(35) 1
Where
( z     )(z  Ds (z))

P0 (z )  P0 (1) exp   D (u )  u du 
3

 k  k    
Ds (z)  
k
1




2
  0
M
   jV j
*
(     z) 3  z 
 1       z  2       z   j 1 
and
 k   M 
and
k 1 2

D3 (u )  S1* (   u ) 0  1V1* (  u)

Ks (z)         jV j (     z)
*
k
 1       z   2       z  j 1 
As in the case of (1), the equation (18) is re-written for
P0 (z) after replacing D(u) by Ds (u).
The expression (38) is identical with the result given by
II. Particular cases Artalejo and Choudhury (2004).
1. No Catastrophe in the system: 4. The System With No Vacation And No Catastrophe
Suppose the occurrence of catastrophe is not allowed ( When there are no calls in the system and the occurrence
 0), then the probability generating function (27) reduces to of catastrophe is not permitted with the server without
vacation and remains in the system.
This implies that
1
P (z )  (z  D (z)) (z  D1 (z ))  K1 (z ) 1P0 (z)
(36)
V j (   z )  1,  j =0 (j=1,2,3,...,M) and   0.
*
1
where
 
* *
D1 (z )  S1 (   z )S 2 (   z )   0 
M
 jV j* (   z)
Then, the p.g.f. of the number of calls P(z) is obtained from
 j 1  (27).
 M 
 {z  0 S1* (   z )S 2* (   z )} 1 Po
K1 (z )  S1* (   z )S 2* (   z )   jV j* (   z) ( z)
P ( z) 
 

 j 1   { z   0 S1* (   z )S 2* (   z)} (39)

and where
1
  D (u) 1 
P0 (z )  P0 (1) exp   D (u )  u du 
1

 z 1 

The result given in (36) is identical with the result of

Senthilkumar and Arumuganathan (2009).

Published By:
Retrieval Number: D5289118419/2019©BEIESP
Blue Eyes Intelligence Engineering
DOI:10.35940/ijrte.D5289.118419 7304 & Sciences Publication
 International Journal of Recent Technology and Engineering
(IJRTE) ISSN: 2277-3878, Volume-8 Issue-4, November 2019

  D (u) 1 
1

0 (z )  P0 (1) exp   D (u )  u du 

P 4

 z 4 
and
D4 (u )  S1* (   u )S 2* (  u).

VII. CONCLUSION AND SUGGESTION

A single server queue is studied with some concepts like
VoIP, Catastrophe, essential and optional services,
impatience, multiple vacations and retrial policy. The steady
state system size distribution and probability generating
functions under different level have been obtained. Some
special and particular cases are discussed and the coincidence
of the present work with some previous research works are
justified. It is suggested that there are some open problems to
be solved by introducing bulk size rules in arrival or services
or both in this existing system.

REFERENCES
1. Artalejo.J.R. and Choudhry.G (2004), “Steady State Analysis of an
M/G/1 Queue with Repeated Attempts and Two Phase service”,
Quality Tech, and Quantitative Mgt., V.1, 2, pp.189-199.
2. Arumuganathan.R, Judeth Malliga.T and Rathinasamy.A (2007) , “Steady
State Analysis of Non-Markovian Bulk Queueing System with N-policy
and different types of Vacations”, Intl. Jl. of Modern Math.,
V.3, 1, pp.47-66.
3. Arul Freeda Vinodhni.G. and Vidhya.V (2014), “Transient Solution
of a Multi-Server Queue with Catastrophes and Impatient Customers
when System in Down”, Appl. Mathl.Sci.V.8, .92, pp.4585-4592.
4. Ayyapan.G, Devipriya.G and Subramanian.A.M.G. (2013), “Analysis
of a Single Server Fixed Batch Service Queueing System under
Multiple Vacation with Catastrophe”, Math. Theory and Modeling,
V.3, 11, pp.35-41.
5. Balasubramanian.M, Bharathidass.S. and Ganesan.V (2015)-“A Finite
Size Markovian Queue With Catastrophe And Bulk Service”, Intl. Jl.
of Applied Inf. Science and Tech., V.40, 40, pp.194-198.
6. Choudhury.G and Madhuchanda.P (2014), “Analysis of a Two Phases
Batch Arrival Queueing Model with Bernoulli Vacation Schedule”,
Revista In. Opl., V.24, 3, pp.217-228.
7. Dhanesh Garg (2013)-“Performance Analysis of the number of Times
a Single Server Queue Reaches its Capacity in time „t‟ with
Catastrophes and Restorations”, AJOR, V.3, 3, pp.75-82.
8. Doshi.B.T.(1985), “An M/G/1 Queue With Variable Vacation”,
Proceedings of Intl. Con. on Performance Modeling, Sophia Antipolis
France.
9. Falin.G.I. and Templeton.J.G.C. (1997), “Retrial Queues”, Chapman
and Hall, London.
10. Jain.N.K. and Bura.G.S.(2010), -“Transient solution of an M/M/1/N
Queue subject to Uniformly Distributed Catastrophic Intensity with
Restoration”, IJCSM, V.2, 3, pp.277-283.
11. Jeyakumar.S and Arumuganathan.R. (2011), “A Non-Markovian
Bulk Queue with Multiple Vacations and Control Policy on request
for Re-Service”, Quality Technology of Quantitative Mgt., V.8, 3,
pp.253-269.
12. Ponnammal.T, Easwara Prasad and Ganesan.V (2013), “Hyper
Exponential Arrival Queue with Impatient Customers”, IJMA, V.5, 2,
pp.83-89.
13. Senthilnathan.M & Arumuganathan.R (2009), “Performance Analysis
Of A M/G/1 Retrial Queue With Non-Persistent Calls, Two Phases Of
Heterogeneous Service And Different Vacation Policies”, Intl. Jl. of
Open Problems Com. Math., V.2, 2, pp.196-214.
14. Sudhesh.R.(2010), “Transient Analysis of a Queue with System
Disasters and Customer Impatience”, Queueing Systems, V.66,
pp.95-105.
15. Swaminathan.P, Eswara Prasad,G and Madhu Suresh.V.S. (2015),
“Tandem Queueing Model With Blocking And Catastrophes”,
Journal of Computer Technology, Vol.4, Issue 2, pp.124-132.

Published By:
Retrieval Number: D5289118419/2019©BEIESP Blue Eyes Intelligence Engineering
DOI:10.35940/ijrte.D5289.118419 7305 & Sciences Publication