An approximate analysis of a token ring network with nonpreemptive priority under go-back-to-higher-priority discipline

Abstract

The authors present an approximate analysis of an asymmetric token ring network with nonpreemptive priority under a new discipline named the go-back-to-higher-priority discipline. This discipline is described and the token ring network is analysed on the basis of the independent hypothesis for the distribution of the cycle time. Then, probabilities for the number of messages at the token's arrival, a mean cycle time, a mean intervisit time of the token and a mean waiting time of messages for each priority level are obtained. To calculate the mean waiting time for a lower priority level, a root of the denominator of the generating function plays an important role. In some numerical examples with simulation results, the mean waiting time for the go-back-to-higher-priority discipline is compared with that for an asymmetric token ring network with nonpreemptive priority under a one-limited discipline. >