Analysis of methods for priority accessing of a local network with contrained message delivery time

An analytical model is discussed for organizing dynamic priorities in decentralized space and time control of network subscribers accessing the common trasmission channel. Efficient disciplines are presented for changing the priorities of subscribers according to urgency of messages and ensuring the access within finite time. Expressions are provided for mean and maximal times of waiting for messages of different urgencies. Numerical results are reported on comparison of these disciplines with priority-free servicing and servicing with relative priorities.