The MAP, queue with preemptive priority
We consider the MAP, queue with preemptive resume priority, where low priority customers arrive to the system according to a Markovian arrival process (MAP) and high priority customers according to a Poisson process. The service time density function of low (respectively: high) priority customers is (respectively: ). We use the supplementary variable method with Extended Laplace Transforms to obtain the joint transform of the number of customers in each priority queue, as well as the remaining service time for the customer in service in the steady state. We also derive the probability generating function for the number of customers of low (respectively, high) priority in the system just after the service completion epochs for customers of low (respectively, high) priority.
Copyright © 1997 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.