A Unified Method for Delay Analysis of Random Multiple Access Algorithms,

Abstract

This paper presents a unified method for the delay analysis of a large class of random multiple-access algorithms. This method is based on a powerful theorem referring to regenerative processes, in conjunction with results from the theory of infinite dimensionality linear systems. The authors apply the method to analyze and compute the per packet expected delays induced by two algorithms, in the presence of the Poisson user model. The considered algorithms are: The controlled ALOHA algorithm, and the 0.487 algorithm. The same method has been previously applied, for the delay analysis of certain limited sensing random access algorithms. Keywords: communications networks; allocations. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1986
Accession Number
ADA164407

Entities

People

  • L. Georgiadis
  • L. Merakos
  • P. Papantoni-kazakos

Organizations

  • University of Connecticut

Tags

Communities of Interest

  • Materials and Manufacturing Processes
  • Space

DTIC Thesaurus Topics

  • Algorithms
  • Collisions
  • Computations
  • Computer Science
  • Electrical Engineering
  • Engineering
  • Linear Systems
  • Markov Chains
  • Markov Processes
  • Multiple Access
  • New York
  • Probability
  • Probability Distributions
  • Random Variables
  • Steady State
  • Stochastic Processes
  • Two Dimensional

Readers

  • Mathematical Modeling and Probability Theory.
  • Operations Research
  • Radio communications and signal processing.