The Nonpreemptive Priority MAP/G/1 Queue

This paper considers the nonpreemptive priority queue with MAP(Markovian Arrival Process) arrivals. Since MAPis weakly dense in the class of stationary point processes, it is a fairly general arrival process. Service times of customers of each priority class are independent and identically distributed according to a general distribution function that may differ among priority classes. Using both the generating function technique and the matrix analytic method, we derive various formulas for the marginal queue length distribution of each class. Further, we provide the delay cycle analysis of the waiting time distribution of each class and characterize its Laplace-Stieltjes transform.