A performance analysis of a hig-speed slotted-ring acces mechanism with dynamically adaptive slot sizes

A network design is proposed in which the number of tokens has been made adaptive, resulting in a network that can be made to behave like both the token ring and the slotted ring, or anything in between (i.e., it performs optimally for any given message length). Results are presented that show how the number of tokens on the ring actually influences the behavior of the network. Simulation results are given that show the performance gain that is achieved by using this principl