This article is cited in 1 paper

Theory of Probability and Mathematical Statistics

Sufficient ergodicity conditions for queueing systems with non-preemptive priority

A. V. Mistryukov^a, V. G. Ushakov<sup>ba

a</sup> Lomonosov Moscow State University, Moscow
^b Federal Research Center "Computer Science and Control" of Russian Academy of Sciences, Moscow

Abstract: Known results in ergodicity of priority queues are based on the assumption, that interarrival times in each queue have exponential distribution. This paper relaxes this assumption, providing sufficient conditions for queues with two priority classes under assumption, that interarrival times in high priority class queue have hyperexponential distribution. Queues with non-preemptive priority are considered. To formulate desired conditions, we use Lindley's recursion for waiting times of each priority class queue. Using Lyapunov-Foster criteria, we obtain sufficient conditions for given recursion to be Harris-ergodic markov chain.

Keywords: nonpreemtive queues, hyperexponential interarrival times, ergodicity, Lyapunov-Foster criteria, Lindley recursion.

UDC: 510.676, 519.217

Received: 12.12.2018
Revised: 11.01.2019

DOI: 10.26456/vtpmk523

Bibliographic databases:

•