Priority Organization in Queueing Systems Using a Model of the Collective Behavior of Automata

A queueing system with waiting is considered. The arriving Poisson streams have different exponential service times. A system of priorities without interruption is organized directly on the channels without prior knowledge of the incoming stream characteristics. Results obtained by simulation on a computer show that the quality of operation of the proposed system is fairly close to the operating quality of a system with priorities whose probability characteristics are shown in advance.