A Lower Bound to Protocol Information in Data Networks

Abstract

Data communication networks transmit much information besides the actual user's messages. This 'extra' information is called protocol information. This thesis extends Gallager's initial work in providing a information-theoretic lower bound to how much of this protocol information is absolutely necessary for the proper operation of a network. The lower bound is a function of the average amount of time messages are allowed to be delayed before being transmitted. The bound suggests that the strategies considered by Gallager are close to optimal.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1978
Accession Number
ADA056345

Entities

People

  • Charles E. Rohrs

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Coding
  • Communication Networks
  • Communication Systems
  • Computer Communications
  • Computer Science
  • Digital Communications
  • Electrical Engineering
  • Engineering
  • Equations
  • Information Processing
  • Networks
  • Notation
  • Probability
  • Probability Distributions
  • Random Variables
  • Sequences
  • Stochastic Processes

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computer Networking
  • Statistical inference.