Cycle-time properties of the timed token medium access control protocol

We investigate timing properties of the timed token protocol that are necessary to guarantee synchronous message deadlines. A tighter upper bound on the elapse time between the tokenʹs lth arrival at any node i and its (l + (nu))th arrival at any node k is found. A formal proof of this generalized bound is presented.