Cycle-Time Properties of the Timed Token Medium Access Control Protocol
Sijing Zhang, A. Burns and Tee-Hiang Cheng
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 tokens 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.
Download Not Available
BibTex Entry
@article{Zhang2002a,
author = {Sijing Zhang and A. Burns and Tee-Hiang Cheng},
journal = {IEEE Transactions on Computers},
month = {Nov},
number = {11},
pages = {1362-1367},
title = {Cycle-Time Properties of the Timed Token Medium Access Control Protocol},
volume = {51},
year = {2002}
}