An analysis and simulation of multiple ring token networks

An analysis and simulation results for multiple token ring networks are presented. The analysis of multiple-ring networks by Q. Yang et al. (1986) is generalized. Closed-form solutions are presented for the token interarrival time and the probability that a station will transmit when a free token arrives, for any packet length or arrival rate, while load is <1. These solutions are compared with simulation data. The results are in agreement within the usable range of the simulator, for load from 0.01 to 0.90. For the special case of a single ring, the results are in agreement with previously published results on single ring networks. Simulation data show that an optimum number of rings exists to achieve minimum wait time. The data show that a ratio of 0.2 to 0.5 rings per station may provide an optimal design of the network, for the conditions described