Abstract

The familiar results on ergodicity of priority queueing systems were obtained under the assumption that the input streams of requests of all priorities are Poisson. This assumption is weakened by finding the sufficient conditions of ergodicity of queueing systems with two classes of priorities, where the stream of requests of higher priority is hyperexponential, and the one of lower priority is reccurent. Systems with different types of absolute priority are investigated. To obtain the sought ergodicity conditions, relations are determined that link the sequential values of waiting times of each priority.

中文翻译：

---

具有绝对优先级的排队系统遍历性的充分条件

摘要

在所有优先级的请求输入流都是泊松的假设下，获得了有关优先级排队系统遍历性的熟悉结果。通过找到具有两类优先级的排队系统的遍历性的充分条件，可以削弱此假设，其中，较高优先级的请求流是超指数的，而较低优先级的请求流是递归的。研究具有不同类型的绝对优先级的系统。为了获得所寻求的遍历条件，确定将每个优先级的等待时间的顺序值链接起来的关系。