The Community for Technology Leaders
Green Image
ABSTRACT
<p><b>Abstract</b>—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 <i>l</i>th arrival at any node <i>i</i> and its (<i>l</i>+<i>v</i>)th arrival at any node <i>k</i> is found. A formal proof to this generalized bound is presented.</p>
INDEX TERMS
Protocol timing properties, timed token medium access control (MAC) protocol, timed token networks, FDDI networks, real-time communications.
CITATION
Sijing Zhang, Tee-Hiang Cheng, Alan Burns, "Cycle-Time Properties of the Timed Token Medium Access Control Protocol", IEEE Transactions on Computers, vol. 51, no. , pp. 1362-1367, November 2002, doi:10.1109/TC.2002.1047759
93 ms
(Ver 3.3 (11022016))