A disaster queue with Markovian arrivals and impatient customers

We consider a single server queueing system in which arrivals occur according to a Markovian arrival process. The system is subject to disastrous failures at which times all customers in the system are lost. Arrivals occurring during the time the system undergoes repair are stored in a buffer of finite capacity. These customers can become impatient after waiting a random amount of time and leave the system. However, these customers do not become impatient once the system becomes operable. When the system is operable, there is no limit on the number of customers who can be admitted. The structure of this queueing model is of -type that has been extensively studied by Neuts and others. The model is analyzed in steady state by exploiting the special nature of this type queueing model. A number of useful performance measures along with some illustrative examples are reported