Analysis of Queues in a Random Environment with Impatient Customers

We study M/M/c queues (c = 1, 1 < c < infinity and c = infinity) in a Markovian environment with impatient customers. The arrivals and service rates are modulated by the underlying continuous-time Markov chain. When the external environment operates in phase 2, customers become impatient. We focus our attention on the explicit expressions of the performance measures. For each case of c, the corresponding probability generating function and mean queue size are obtained. Several special cases are studied and numerical experiments are presented.