Discipline-Priority Queuing Systems without Serving Interruptions

Abstract

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.