Round Robin Scheduling for Fair Flow Control in Data Communication Networks.
Abstract
This thesis studies a simple strategy for fairly allocating link capacity in a point-to-point packet network with virtual circuit routing. Each link offers its packet transmission slots to its user sessions by polling them in round robin order. In addition, link-by-link window flow control is used to prevent excessive packet queues at the network nodes. As the window size increases, the session throughput rates are shown to approach limits that are perfectly fair the maxmin sense. That is, the smallest session rate in the network is a large as possible and, subject to that constraint, the second-smallest session rate is as large as possible, etc. If each session has evenly spaced packet arrivals or has such heavy demand that packets are always waiting to enter the network, then a finite window size suffices to produce perfectly fair throughout rates. (These properties do not hold if first-come-first-served scheduling is used instead of round robin.)
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1986
- Accession Number
- ADA176064
Entities
People
- Ellen L. Hahne
Organizations
- Massachusetts Institute of Technology