The space division multiple access protocol: asynchronous implementation and performance

  • Authors:
  • Lewis Barnett

  • Affiliations:
  • Department of Mathematics and Computer Science, University of Richmond, Richmond, VA 23173, USA

  • Venue:
  • Computer Communications
  • Year:
  • 1998

Quantified Score

Hi-index 0.24

Visualization

Abstract

Implementation of communication protocols based on collision resolution algorithms on broadcast bus networks requires a level of synchronization among participating stations such that idle steps in the algorithm can be globally and unambiguously detected. We present performance results for two collision resolution algorithms, the Capetanakis tree protocol and space division multiple access, a new algorithm, using a previously described asynchronous implementation technique. Two variants of space division multiple access are discussed. One variant improves upon the mechanism for implementing the necessary synchronization. The other relaxes the requirements for a station with a new packet joining the resolution algorithm. The performance effects of these variations are examined by simulating the behavior of the protocols. The variants are shown to improve the performance of the protocol under some traffic loads. In addition, one of the variants is shown to improve on the fairness of the original algorithm over a variety of offered loads and maximum data rates.