Ergodicity of Two Class Priority Queues with Preemptive Priority

Abstract

Well-known results on the ergodicity of queues with preemptive priority were obtained under the assumption that jobs arrive according to the Poisson process. This assumption, however, does not always hold true in practice. In our work we find sufficient ergodicity conditions for queues with two priority classes with a single server, where interarrival times of high-priority jobs have either Erlang or hyperexponential distribution and interarrival times of low-priority jobs and service times of jobs of both classes have arbitrary continuous distributions. We present results in disciplines with loss of an interrupted job and with retrial of an interrupted job.