Performance of the prioritized random token protocol for high-speed and ratio networks

A random token protocol that incorporates priority functions is presented. In this prioritized random token protocol, the access right to a channel is given to the user of the highest priority by giving the earliest scheduling time. The protocol is suitable for high-speed networks with frequency reconfiguration, and also for mobile networks. It can be used with and without the collision detection feature. The prioritized random token protocol is analyzed with two priority classes and the delay-throughput characteristics for each priority class are determined. It is shown that the proposed protocol yields better throughput-delay performance than the p-persistent protocol of prioritized carrier sense multiple access. In addition, numerical results obtained for various system parameters are discussed and verified by simulation