Limited service token ring with local message priorities

A symmetric limited-service token-ring network is considered. Messages in a station are served with a priority structure. For all priority classes, the message arrivals are assumed to be identically distributed with no further restriction on the type of the distribution. First a nonpriority-limited-service network is studied. Using an auxiliary variable, virtual service time, the model is transformed into a simpler priority queueing problem. Priority queueing analysis methods are then used to verify the average-cycle-time expression from earlier studies. Using the same approach, a method is proposed to determine lower bounds on the moments of waiting time experienced by the messages. Then the approach is generalized to a token ring with local message priorities.<>