×

Matrix-geometric solution of discrete time MAP/PH/1 priority queue. (English) Zbl 0902.90061

Summary: We use the matrix-geometric method to study the discrete time MAP/PH/1 priority queue with two types of jobs. Both preemptive and non-preemptive cases are considered. We show that the structure of the \(R\) matrix obtained by Miller for the Birth-Death system can be extended to our Quasi-Birth-Death case. For both preemptive and non-preemptive cases the distributions of the number of jobs of each type in the system are obtained and their waiting times are obtained for the non-preemptive case. For the preemptive case we obtain the waiting time distribution for the high priority job and the distribution of the lower priority job’s wait before it becomes the leading job of its priority class.

MSC:

90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)
Full Text: DOI