Basic limits on protocol information in data communications networks
Abstract
The paper considers basic limitations on the amount of protocol information that must be transmitted in a data communication network to keep track of source and receiver addresses and of the starting and stopping of messages. Assuming Poisson message arrivals between each communicating sourcereceiver pair, a lower bound is found on the required protocol information for message. This lower bound is the sum of two terms, one for the messagelength information, which depends only on the distribution of message lengths, and the other for the messagestart information, which depends only on the product of the sourcereceiver pair arrival rate and the expected delay for transmitting the message. Two strategies are developed which, in the limit of large numbers of sources and receivers, almost meet the lower bound on protocol information.
 Publication:

IEEE Transactions on Information Theory
 Pub Date:
 July 1976
 Bibcode:
 1976ITIT...22..385G
 Keywords:

 Data Transmission;
 Information Theory;
 Telecommunication;
 Binary Data;
 Coding;
 Extremum Values;
 Markov Processes;
 Messages;
 Communications and Radar