Simple Approximations for Token Rings

Abstract

Recently, a conservation law for the waiting times at a token ring has been derived. This conservation law is used here to develop simple approximations to the waiting times at individual queues on a token ring. Although exact algorithms are available, they may require significant computation time. In contrast, the approximation developed here is easily calculated on a pocket calculator, and is more accurate than earlier approximations.