Analysis and simulation of a fair queueing algorithm
Alan J. Demers, S. Keshav, Scott J. Shenker · ACM SIGCOMM Computer Communication Review · 1989
We discuss gateway queueing algorithms and their role in controlling congestion in datagram networks. A fair queueing algorithm, based on an earlier suggestion by Nagle, is proposed. Analysis and simulations are used to compare this algorithm to other congestion control schemes. We find that fair queueing provides several important advantages over the usual first-come-first-serve queueing algorithm: fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth, and protection from ill-behaved sources.
Cited by 2,614 works. doi:10.1145/75247.75248 Open-access PDF
Authors
References
- Congestion avoidance and control
- Congestion control in IP/TCP internetworks
- Flow Control: A Comparative Survey
- A new architecture for packet switching network protocols
- Improving round-trip time estimates in reliable transport protocols
- On Packet Switches with Infinite Storage
- The fuzzball
- Dynamic control of session input rates in communication networks
- Fast switching and fair control of congested flow in broadband networks
- The NSFNET backbone network