A queuing model for a processor-shared multi-terminal system subject to breakdowns

This paper deals with a non-homogeneous finite-source queuing model to describe the performance of a multi-terminal system subject to random breakdowns under PPS (Priority Processor-Sharing) service discipline. It can be viewed as a continuation of paper [l], which discussed a FIFO (First-ln, FirstOut) serviced queuing model subject to random breakdowns. All random variables are assumed to be independent and exponentially distributed. The system's behaviour can be described by a Markov chain, but the number of states is very large (it is a combinatorically increasing function of the number of terminals). The purpose of this paper is to give a recursive computational approach to solve the steady-state equations and to illustrate the problem in question using some numerical results