Performance modeling and analysis of a priority token-ring network

Abstract

The performance of token-ring networks with priority traffic is analyzed under a uniform Poisson traffic model. Approximate expressions are obtained for the mean access and waiting times of each of the priority classes. Our ring model considers the finite time that it takes for the priority information to propagate on the ring. Also, a network adaptor architecture is considered where there exists a single queue for packets of all priority levels that are serviced in FIFO order, but when a packet is scheduled for transmission at a station, it competes only with the same or higher priority packets residing at the head of the queues at the rest of the stations.