On the Analysis of Unreliable Markovian Multiserver Queue with Retrials and Impatience

Abstract

This paper concerns an approximate analysis of a Markovian multiserver infinite source retrial queuing with impatience, in which all the servers are subject to breakdown andrepairs. Customer who find the total number of busy and failed servers equal to $s$,i.e, he is given to choice to enter a retrial orbit for an random amount of time before attempting to