(no subject)

Review: Analysis and Simulation of a Fair Queueing Algorithm

Reviewer: Di Niu

This paper analyzes the variation of a fair queueing algorithm at
gateways called FQ, originally proposed by Nagle. According to the
paper, queueing algorithm at the gateways are one of three important
categories of congestion control. The other two are E2E flow control
and adaptive routing.

The fair queueing algorithm requires the knowledge of per-connection
state. This requirement has made the algorithm quite complicated and
hairy to implement. Furthermore, it is not sure whether connections
are the objects we should give fairness to.

However, the paper made very good arguments in supporting this fair
queueing algorithm. First, some modification on the original FQ was
made to reduce the sensitivity to timing and accommodate a large
variation in packet lengths. A fairness criterion is then adopted and
the connection-wise fairness is justified to be the focus of the
analysis. The algorithm was designed to achieve fair allocations on
bandwidth, promptness and buffer space. It improves the performance
under ill-behaved users' presence, compared with FCFS queueing.
Received on Wed Sep 27 2006 - 23:02:54 EDT