Catastrophe modeling and analysis had been playing a vital role in various areas of science and technology. Chao [1] has modeled computer networks with a virus by queuing networks with catastrophes. Kumar et al. [2] and [3] studied the transient behaviour of the M/M/2 queue with catastrophes. Di Crescenzo et al. [4] made a continuous approximation of M/M/1 queue with catastrophe. Jain and Kumar [5] and [6] obtained the transient solution of a catastrophic-cum-restorative queueing problem with correlated arrivals and variable service capacity and special case of [7] - [10] . In all the above mentioned studies, the researchers have obtained the state probabilities in one way or the other and have computed various measures of performance. In this paper, the occurrence of a catastrophe makes the system empty instantly whenever the system is not empty but the system takes its own time to ready to accept new customers. This time is referred to as “the restoration time”. The system subjected to catastrophes must take some time for its restoration after the occurrence of a catastrophe. We have obtained explicitly the distribution of the number of times the system reaches its capacity in time t under the effects of catastrophe and restoration.

We consider an M/M/2/N queueing system having two homogenous servers with FCFS discipline subject to catastrophes and restorations. The customers arrive at a counter in accordance with a Poisson process with mean arrival rate. Each server serves one customer at a time if available. The service time distribution of a customer is negative exponential with mean rate. The queuing process starts at time zero with zero state of the system. Catastrophes occur according to Poisson process with mean rate only when the system is not empty. The occurrence of a catastrophe destroys all the customers in the instants and affects the system as well. The system will require some sort of time to restarts in a normal way, which is taken as restoration time. The restoration times are independently, identically exponentially distributed with parameter. The customers arrive in the system during the restoration time as usual.

We define joint probability distribution

where the number of times the system reaches its capacity in time t;

the number of customers in the system at time t;

the prob. that there are zero customers in the system at time t without the occurrence of catastrophe;

the prob. that there are zero customers in the system at time t with the occurrence of catastrophe destroying all the customers.

Taking Laplace transform of the Equations (2)-(6) w.r.t. t we have

Since

where,

Define the probability generating functions by

Multiplying Equation (8) to (14) by, summing over the ranges of and using (15), we have

Multiplying Equation (18) to (21) by, summing over the ranges of n and using Equations (16) (17), we have on simplification:

The zeros of the denominator in (22) are given by

The existence of is only possible if numerator vanishes for and the two zeros of the denominator. This will give rise two equations, solving them we have:

where

Now is the coefficient of in (16). Comparing the coefficients of on both sides, we have:

Applying the Leibniz differentiation theorem to (24), setting and dividing both sides by. On simplification, we have:

From (27), we have

where

We know that,

Using these identities in above equations, We are now in a position to complete the solution for the joint distribution of and. Taking the Inverse Laplace transform, using the tables [11] - [13] , we have:

(30)

(32)

where,

This paper discussed the transient solution of M/M/2/N queuing system with catastrophic and restorations effects on the number of times system reached its capacity in time t. This model finds its application in computer- network communications, telecommunications etc.

Dhanesh Garg, (2015) Transient Solution of M/M/2/N System Subjected to Catastrophe cum Restoration. Open Access Library Journal,02,1-8. doi: 10.4236/oalib.1101404