A dynamically changing road traffic model which occasionally suffers a disaster (traffic collision, wrecked vehicles, conflicting weather conditions, spilled cargo, and hazardous matter) resulting in loss of all the vehicles (diverted to other routes) has been discussed. Once the system gets repaired, it undergoes trial phases and finally reaches its full capacity phase n. We have obtained the explicit steady state probabilities of the system via Matrix Geometric Method. Probability Generating Function is used to evaluate the time spent by the system in each phase. Various performance measures like mean traffic, average waiting time of vehicles, and fraction of vehicles lost are calculated. Some special cases have also been discussed.

1. Introduction

Qualitative behavior of Markovian Arrival Process (MAP) and its mathematical descriptions are discussed in Gross [1] and Neuts [2]. Queueing models with disaster are seen in call center applications, computer networks, or telecommunication applications which depend upon satellites [310], manufacturing process, and all means of transportations. In this paper, we have considered a system which undergoes a random disastrous failure, resulting in all vehicles to be cleared out of the system (directed to other roadways) and thus lost. The system then undergoes a repair phase 0 having duration which follows exponential distribution. Being repaired, the system will move to its full capacity after succeeding all its trial phases. System may fail at any of these trial phases with probability and go to repair phase 0 or succeed with probability and move to its next phase. Once it has succeeded all its trial phases and reached its full capacity, it may continue in that phase until a disaster occurs and goes to phase 0. In 1973, Yechiali [9] has introduced the generalization of the abovementioned model but concluded that analytical solution of such a model is not possible. Paz and Yechiali [4] have considered a similar type of system with n phases, where the system after repair is allowed to go to any one of its other phases and stay there itself until a failure occurs. The transition between the operating phases is not allowed. But in many practical situations whenever failure occurs the system is repaired and it undergoes many trial phases to reach its full capacity. Taking this situation in mind, the present model has been formulated. Sophia and Praba [5] introduced one trial phase with many operating phases. Here, we take repair phase 0, trial phases, and only one full capacity phase n which is more relevant to road traffic and metro models. Transient solution of the model proposed by Paz and Yechiali [4] was solved by Udayabaskaran and Dora Pravina [7]. M/G/1 queue in multiphase random environment with disasters was analyzed by Jiang et al. [6]. It has been well studied that it is a new approach of dynamically changing road traffic problems and metro projects.

The rest of the paper has been organized as follows. The mathematical model of two-dimensional random processes is formulated in Section 2. Section 3 gives the probabilities of the system in steady state which is derived explicitly using Matrix Geometric Method. The time spent by the system in each phase is calculated in Section 4 by using Probability Generating Function method. Various other performance measures are described in Section 5. In the mathematical model discussed above, the vehicles are allowed to arrive when the system is down. A special case when the vehicles are not allowed when the system is in repair phase is considered and the validity of the model is discussed in Section 6. The results obtained by both the methods are proved to be the same by using numerical examples in Section 7. Section 8 gives the conclusion and finally the references are listed.

2. The Mathematical Model

2.1. Model

Consider a M/M/1 type queue with repair phase 0, trial phases, and only one full capacity phase n in an underlying random environment. This special random environment is an -dimensional continuous time Markov chain, with phases governed by the probability transition matrix given below. A similar type of continuous time Markov chain with n phases is discussed in [4, 5, 7]:

In the repair phase , the arrival of the customers is continuous at the rate of but service is not rendered. When in phase , the system behaves as a queue, with arrival rate () and service rate () which follows Poisson distribution. The time spent by the system in phase i has mean which is exponentially distributed. The system moves to trial phase 1 once the repair is completed. After residing in phase 1 for time, it moves to phase 2 with probability . In case of any disaster in phase 1, it goes to phase 0 with probability . Thus, it travels from phase 1 through phases provided no disaster takes place in any of these phases and finally reaches phase n. In case a disaster happens in any of these phases, the system goes to phase 0 and restarts its switch over process. The system resides in phase n until a disaster happens and sends it to phase 0. Such disasters are studied in [3, 8].

2.2. Balance Equations

The stochastic process under consideration is two-dimensional and describes the system at any time t as follows. System state is denoted by [0: repair phase; : trial phases; n:full capacity phase] and denotes the number of customers in the system . The bivariate process is a Markov chain with state space , where .

Let represent the joint steady state probability of the system in server state and number of customers . Then, the differential difference equation of the system is given by

3. Matrix Geometric Method

3.1. Level Dependent QBD Process

The steady state solution of the abovementioned model can be solved by using Neuts [2] approach. Matrix Geometric Method is used to calculate steady state probabilities of Markovian arrivals [11]. The level dependent QBD bivariate process with infinitesimal generator Q is given as follows:where is the zero matrices with appropriate dimension and and are square matrices of order given as follows: where , , , and :

Lemma 1. The necessary and sufficient condition for the process to be positive recurrent is
The following system of equations has the stationary distribution solution :Here, vector e represents a column vector with entries as ones and vector O represents a row vector with an appropriate dimension whose entries are zeros.
Let with where . Then,Implying thathere, is a square matrix of order and is the solution of the following equation:

3.2. Evaluation of Matrix

As the matrices , and have upper diagonal form, it follows from (11) that matrix will also have the upper diagonal structure as follows: Using (11) and (12), the nonzero entries of are given by

3.3. Calculation of

Using matrix in (9) and normalizing the obtained vector with , we get . Using (8), the remaining can be calculated. Thus, the entire system is defined.

4. Probability Generating Function

Under steady state conditions, (2) becomesSubstituting Q of this model into of Yechiali [9], the above mentioned steady state equations coincide with steady state equations of Yechiali [9].

Consider Probability Generating Functions defined as follows [see [1]]:Then,Also,

4.1. Proposition

The probability of zero customers in phase 0 is given by

Proof. Using (20) in (15), we prove thatPutting in (24), we get
Using (20) in (17), we prove thatPutting in (25), we get
Using (20) in (19), we prove thatPutting in (26), we get Using recursively the abovementioned equations, we prove thatUsing these results in (22), we prove that

4.2. To Find the Probability That the System Resides in Phase

With the direct usage of (15) recursively, we get Hence, is found for .

Thus, the proportion of time in which the system resides in phase 0 is

These probabilities coincide with Yechiali [9].

4.3. To Find the Probability That the System Resides in Phase

From (24), we get

Rearranging (25) and (26), we get DefineEach quadratic polynomial has two roots that are real. The only root of which lies in the interval is denoted by . This result holds becauseThe root is given by Here, represents the LST (Laplace Stieltjes Transform), evaluated at point , of the busy period in a M/M/1 queue with arrival rate and service rate .

Substituting into (31), we can easily prove that Thus, each PGF is completely determined by the abovementioned equations. Any probability can be calculated by differentiating and substituting .

The probability that the system resides in phase 1 is

The probability that the system resides in phase is

5. Performance Measures

As , .

The number of customers in phase

Thus,The number of customers in the system at any time is

Let C be the number of customers cleared from the system per unit time. Then,

The fraction of customers receiving full service is therefore

6. Special Cases

6.1. Validation of the Model [No Trial Phase]

When there are no trials in between (ie) after repair phase 0, the system directly moves to the full capacity phase; the general model introduced here coincides with Yechiali [10] with Assuming , the system goes to full capacity phase directly. Also all the results obtained become where is the root of as discussed earlier.

6.2. Arrival Stops When System Is Down

When customers are not allowed during repair phase 0, we have

7. Numerical Example

Consider a traffic model which on completion possesses one repair phase 0, two trial phases 1, 2, and one full capacity phase 3 with the following data.

Case 1. Consider

Case 2 (sensitivity when ). The various steady state probabilities of both the cases are listed in Table 1 and the corresponding graph showing their comparison is given as Figure 1.
The probability that the system resides in each phase is calculated by both Matrix Geometric Method and Probability Generating Function method and listed in Table 2. It is observed that the probabilities coincide by both the methods proving the validity of our analytical results.

8. Conclusions

We have modeled a dynamically changing traffic model which undergoes disaster as a M/M/1 queue with repair phase 0, trial phases , and full capacity phase n. Steady state probabilities and other performance measures are calculated by two methods: Matrix Geometric Method and Probability Generating Function method. Numerical illustrations prove that the results obtained by both methods are one and the same. Also, validity of the model and sensitivity analysis are discussed as special cases.

Since the abovementioned model is more suitable for metro trains, traffic networks, and so forth, the transient solution will be more suitable and hence it can be considered for future research. The abovementioned model can be treated as M/G/1 queue and its steady state solution can be found.

Competing Interests

The authors declare that they have no competing interests.