The discrete-time MAP/PH (Geom/PH)/1 queueing system with a repairable server

The discrete-time MAP/PH (Geom/PH)/1 queueing system with a repairable server

0.00 Avg rating0 Votes
Article ID: iaor2003807
Country: China
Volume: 29
Issue: 4
Start Page Number: 24
End Page Number: 27
Publication Date: Oct 2001
Journal: Journal of Henan Normal University
Authors: ,
Keywords: markov processes
Abstract:

In this paper we study a discrete-time repairable queueing system with a Markovian arrival process. Provided that the lifetime of a server follows a geometric distribution, the service time and the repair time follow discrete phase type distributions. We first consider the generalized service time and prove that it has discrete phase type variables. Then we obtain the steady state distribution of queue length. At the same time we give the mean waiting time and the stable availability of the system.

Reviews

Required fields are marked *. Your email address will not be published.