Round Robin Scheduling for Fair Flow Control in Data Communication Networks
Abstract
Round robin link scheduling, in conjunction with conventional window flow control, can be used to achieve throughput fairness in point-to-point packet networks with virtual circuit routing. Consider a data communication network consisting of store-and-forward nodes joined by point-to-point links. Each user session is assigned a fixed path (often called a virtual circuit) through the network, and data for the session are sent in packets along this path. In such a network it is possible for the incoming traffic rate at a node to exceed the outgoing rate, causing a data queue to build up a at that node. This queue may eventually overflow the node's storage space, or the delay of acknowledgements may cause transmitters to assume that data were lost. These problems result in wasteful retransmission that effectively reduce the capacity of the network. Flow control procedures attempt to prevent or alleviate this degradation by regulating the appropriate traffic sources.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1986
- Accession Number
- ADA166728
Entities
People
- Ellen L. Hahne
- Robert G. Gallager
Organizations
- Massachusetts Institute of Technology