Queueing System MAP/PH/N with Propagated Failures

We consider the MAP/PH/N queueing system with propa- gated breakdowns. Breakdowns arrive in bunches (we call them attacks) according to the MAP. The process of further arrival of different types of server failures within an attack is governed by phase type Markov process. Recovering of the server takes an exponentially distributed time with intensity depending on the type of the occurred failure. We de- scribe the behavior of the system by the multi-dimensional continuous time Markov chain and analyze conditions for existence of its stationary behavior and compute its stationary distribution. Waiting time distribu- tion and the key performance measures of the system are computed.