An accelerated algorithm of decentralized priority control of access to a common channel

A new technique is proposed for priority ultiple access to a common channel to insure theoretically minimal overhead costs of taking up the channel with priority specified in a binary code. Several most effective ways of multiple access in an $M/D/1$ model are compared.