Analysis and simulation of a fair queueing algorithm
- 1 August 1989
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 19 (4) , 1-12
- https://doi.org/10.1145/75246.75248
Abstract
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.Keywords
This publication has 10 references indexed in Scilit:
- Congestion avoidance and controlPublished by Association for Computing Machinery (ACM) ,1988
- The fuzzballPublished by Association for Computing Machinery (ACM) ,1988
- Fast switching and fair control of congested flow in broadband networksIEEE Journal on Selected Areas in Communications, 1987
- The NSFNET backbone networkPublished by Association for Computing Machinery (ACM) ,1987
- Improving round-trip time estimates in reliable transport protocolsPublished by Association for Computing Machinery (ACM) ,1987
- On Packet Switches with Infinite StorageIEEE Transactions on Communications, 1987
- Dynamic control of session input rates in communication networksIEEE Transactions on Automatic Control, 1984
- Congestion control in IP/TCP internetworksACM SIGCOMM Computer Communication Review, 1984
- Queueing and Framing Disciplines for a Mixture of Data Traffic TypesAT&T Bell Laboratories Technical Journal, 1984
- Flow Control: A Comparative SurveyIEEE Transactions on Communications, 1980