Full Analysis of a Powerful Window Random Access Algorithm.

Abstract

A simple full sensing window random access algorithm is analyzed in the presence of the limit Poisson user model. The throughput of the algorithm is 0.43, and its delay and resistance to channel errors characteristics are superior to those induced by the Capetanakis window algorithm. In addition, the simple operations of the algorithm, in conjunction with its regenerative properties, allow for the computation and evaluation of the output traffic interdeparture distribution. The latter is needed in the evaluation of interacting systems which use the algorithm for their internal transmissions.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1988
Accession Number
ADA192437

Entities

People

  • M. Paterakis
  • P. P. Kazakos

Organizations

  • University of Virginia

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Bernoulli Distribution
  • Classification
  • Collisions
  • Computations
  • Computer Science
  • Electrical Engineering
  • Engineering
  • Environment
  • Information Theory
  • Markov Chains
  • Military Research
  • Probability
  • Random Variables
  • Security
  • Steady State
  • Throughput

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Mathematical Modeling and Probability Theory.
  • Radio communications and signal processing.