Accession Number:

ADA056345

Title:

A Lower Bound to Protocol Information in Data Networks

Descriptive Note:

Master's thesis

Corporate Author:

MASSACHUSETTS INST OF TECH CAMBRIDGE ELECTRONIC SYSTEMS LAB

Personal Author(s):

• Rohrs, Charles E.

Report Date:

1978-06-01

Pagination or Media Count:

58.0

Abstract:

Data communication networks transmit much information besides the actual users messages. This extra information is called protocol information. This thesis extends Gallagers 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.

Descriptors:

• *COMPUTER COMMUNICATIONS
• *INFORMATION THEORY
• DATA RATE
• DATA TRANSMISSION SYSTEMS
• MESSAGE PROCESSING
• MULTIPLEXING
• QUEUEING THEORY
• ROUTING
• SCHEDULING
• SWITCHING
• THESES

Subject Categories:

• Cybernetics
• Non-Radio Communications

Distribution Statement:

APPROVED FOR PUBLIC RELEASE