Matrix-geometric solution of discrete time MAP/PH/1 priority queue

Matrix-geometric solution of discrete time MAP/PH/1 priority queue

0.00 Avg rating0 Votes
Article ID: iaor19983067
Country: United States
Volume: 45
Issue: 1
Start Page Number: 23
End Page Number: 50
Publication Date: Feb 1998
Journal: Naval Research Logistics
Authors:
Keywords: MAP/G/1 queues
Abstract:

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. 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.

Reviews

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