A Lower Bound to Protocol Information in Data Networks.

摘要

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.