Abstract:
A least upper bound is derived on the amount of adjustment of virtual token passing (VTP) time needed to assure collision-free access control in VTP networks (i.e. networ...Show MoreMetadata
Abstract:
A least upper bound is derived on the amount of adjustment of virtual token passing (VTP) time needed to assure collision-free access control in VTP networks (i.e. networks that use 'time-out' or scheduling function-based access protocols) and in which nodes change their spatial configuration due to motion (although always stay within range and in line-of-sight of each other). Since the new bound is a function of network geographical size, as well as of node maximal speeds and the time that passed since the previous adjustment, it allows VTP times that are shorter than those found in previous publications, especially when intervals between adjustments grow larger. For most VTP networks, with large mixed populations of mobile and stationary users, the average VTP time (which is a major factor in performance of the access protocol) allowed by the new bound is shorter than that of any configuration-independent protocol.<>
Published in: IEEE Transactions on Computers ( Volume: 37, Issue: 9, September 1988)
DOI: 10.1109/12.2272