Analysis and Simulation of a Fair Queueing Algorithm

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-firstserve queueing algorithm: fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth, and protection from ill-behaved sources.

• Type: Conference
• Year: 1989
• Where: SIGCOMM
• Authors: Alan J. Demers, Srinivasan Keshav, Scott Shenker
• Keywords: Communications, Fair Queueing, Fair Queueing Algorithm, Gateway Queueing Algorithms, SIGCOMM 1989