Token ring local area networks: A comparison of experimental and theoretical performance

Abstract

Many existing performance models for local area networks are based on the assumptions of random traffic patterns and infinite buffer capacity. All real network implementations violate the infinite capacity assumption, while an increasingly popular class of local area network applications violates the randomness assumption. This paper describes the experimental measurements of the characteristics of a commercially available token ring network. It is shown that the violation of both assumptions invalidates model predictions, and that the utility of all access control mechanisms for such applications must be re-evaluated. Finally, it is shown that congestion is a very real problem even in small “simple” local area networks. Schemes for controlling interface congestion may require rather novel approaches to the problem.