A simple window random access algorithm with advantageous properties

  • Authors:

  • M. Paterakis;P. Papantoni-Kazakos

  • Affiliations:

  • Dept. of Comput. & Inf. Sci., Delaware Univ., Newark, DE;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

Abstract

A simple full-feedback-sensing window random access algorithm is proposed and analyzed. The throughput of the algorithm is 0.429; its delay and resistance to feedback channel errors are better than those induced by J.I. Capetanakis's (ibid., vol.IT-25, p.505-15, Sept. 1979) window algorithm. In addition, the simple operations of the algorithm allow for the analytical evaluation of the output-traffic interdeparture distribution