A nonpreemptive priority MAP/G/1 queue with two classes of customers

This paper considers a nonpreemptive priority queue with two classes of customers. Customers in each priority class arrive to the system according to a Markovian arrival process (MAP). Since the MAP is weakly dense in the class of stationary point processes, it is a fairly general arrival process. The service times of customers in each priority class are independent and identically distributed according to a general distribution function which may differ among two priority classes. Using both the generating function technique and the matrix analytic method, the paper derives various formulas for the queue length and waiting time distributions. It also discusses the algoirthmic implementation of the analytical results along with numerical examples.