A bridge between preemptive and non-preemptive queueing models

A preemptive priority MAP, GG1, G21 queue with two types of customers is considered. Here, the priority customersʹ arrival process follows the Markovian Arrival Process. The relationship between the work load and waiting times of priority and non-priority customers is derived. As a result a new conservation law for the preemptive queue is obtained. Using this law and the waiting times of the preemptive queue, waiting times for a non-preemptive priority queue can be represented.