Dynamic Scheduling Protocols for a Multiple-Access Channel

In this paper the multiple-access problem in a packet network is considered. A finite number of independent, packet transmitting users is assumed. Protocols are developed to allocate the channel resources among the users. Part of the channel capacity is assigned to control information. This information is used to make probabilistic inferences of the queue lengths and delay characteristics of the users. The probabilistic inferences are used to develop dynamic scheduling protocols for data transmission. Protocols are developed for two different levels of control information. An analysis of the relationship between amount of control information and system performance is carried out, and a study of the frequency of transmission of control information is also provided.