We present a new approach for analyzing token ring LANs. The token ring model presented supports the behavior obtained from actual ring measurements. Using this model, employing deterministic bounds analysis techniques, we prove several theorems which lead to some interesting conclusions that support observed ring performance. The results obtained give insight into practical behavior of a token ring environments.>

In this paper we employ a deterministic analysis technique to characterize the dynamic queueing aspects of window protocols. The deterministic behavior of these protocols and the deterministic influence of the resources along the physical path are explicitly considered in the evaluation of path queue behavior. Transient and steady state queue behavior of fixed and sliding window protocols are investigated. We discover the existence of significant nonlinearities in the dynamics of queue activity.