Sojourn time analysis for processor sharing loss queuing system with service interruptions and MAP arrivals

Abstract

Processor sharing (PS) queuing systems are widely investigated by research community and applied for the analysis of wire and wireless communication systems and networks. Nevertheless, only few works focus on finite queues with both PS discipline and service interruptions. In the paper, compared with the previous results we analyze a finite capacity PS queuing system with Markovian arrival process, unreliable server, service interruptions, and an upper limit of the number of customers it serves simultaneously. For calculating the mean sojourn time, unlike a popular but computational complex technique of inverse Laplace transform we use an effective method based on embedded Markov chain. A practical example concludes the paper.