No abstract

No abstract

No abstract

This paper analyses a Markovian retrial queue where the server is subject to breakdowns and repairs. It is assumed that the breakdowns/repairs behaviour when the server is idle is different from the one when it is busy. Under the steadystate condition, explicit expressions for the partial probability generating functions of the server status and the number of customers in the orbit are obtained along with some key performance measures of the system. In addition, we study two new orbit characteristics, namely, the orbit idle period and the orbit busy period by using the first principle arguments. An approximate method of analysis for the system with losses is also suggested. The stochastic decomposition property is shown to hold good for the underlying retrial queueing system. Besides, we study the asymptotic behaviour of the system size under extreme conditions. Finally, some numerical results are illustrated.

No abstract