Cycle-Time Properties of the Timed Token Medium Access Control Protocol

  • Authors:
  • Sijing Zhang;Alan Burns;Tee-Hiang Cheng

  • Affiliations:
  • -;-;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 2002

Quantified Score

Hi-index 14.98

Visualization

Abstract

We investigate the 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+v)th arrival at any node k is found. A formal proof to this generalized bound is presented.