Summary: Analysis and Simulation of a Fair Queueing Algorithm
3333 Coyote Hill Road
Palo Alto, CA 94304
We discuss gateway queueing algorithms and their
role in controlling congestion in datagram networks.
A fair queueing aJgorithm, based on an earlier
suggestion by Nagle, is proposed. An.alysis 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.