A one-channel queuing system with r types of requirements, relative priority, and random-intensity Poissonian input flow is studied. The current intensity value is taken at the beginning of the time reckoned for the arrival of the next requirement. Successive values of the flow intensity form a Markov chain of a special kind. A nonstationary distribution of the vector of lengths is found for queues of requirements of different types.

中文翻译：

---

无服务中断的学科优先排队系统

研究了具有r种需求，相对优先级和随机强度泊松输入流的单通道排队系统。当前强度值是在预计的下一个要求开始的时间开始时获取的。流动强度的连续值形成一种特殊的马尔可夫链。对于不同类型的需求队列，发现了长度向量的非平稳分布。