An Efficient Contention Resolution Algorithm for Multiple Access Channels

Abstract

In this thesis, the general form of a first-come first-served contention resolution algorithm is given. A sub-class of FCFS algorithms, called single interval algorithms, are analyzed using Markovian decision theory. It is seen that, if the horizon is infinite, Humblet's algorithm has the maximum throughput for this sub-class. However, if the system is shut down after a finite number of transmissions, then an extended version of his algorithm is optimal.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1979
Accession Number
ADA072440

Entities

People

  • Jeannine Mosely

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programs
  • Decision Theory
  • Discontinuities
  • Engineering
  • Equations
  • Information Processing
  • Mathematics
  • Military Research
  • Multiple Access
  • Numbers
  • Probability
  • Real Numbers
  • Stationary
  • Statistics
  • Theorems

Readers

  • Computer Networking
  • Mathematical Modeling and Probability Theory.