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 method is applied to analyze and compute the per packet expected delays induced by three algorithms, in the presence of the Poisson user model. The considered algorithms are: The controlled ALOHA algorithm, the 0.487 algorithm, and the n-ary stack algorithm. Additional keywords: Communications networks; Markovian models; Throughput; Delay. (Author).

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1985
Accession Number
ADA159108

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

  • Air Force
  • Algorithms
  • Communication Networks
  • Computer Science
  • Connecticut
  • Electrical Engineering
  • Engineering
  • Equations
  • Information Science
  • Linear Systems
  • Markov Chains
  • Markov Processes
  • Multiple Access
  • Probability
  • Random Variables
  • Steady State
  • Stochastic Processes

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Computer Networking
  • Mathematical Modeling and Probability Theory.