PERFORMANCE OF THE PRIORITIZED RANDOM TOKEN PROTOCOL FOR HIGH-SPEED AND RADIO NETWORKS

In this paper, we present a random token protocol that incorporates priority functions. 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 frequent reconfiguration, and also for mobile networks. It can be used with and without the collision detection feature. We analyze the prioritized random token protocol with two priority classes and get the delay-throughput characteristics for each priority class. We show that the proposed protocol yields better throughput-delay performance than the p-persistent protocol of prioritized carrier sense multiple access. In addition, we discuss numerical results obtained for various system parameters and verify them by simulation.