A Comparison of Fair Queuing Algorithms for the Internet

C. Altinbuken, L. Yao, and S. Subramaniam (USA)


Information Systems, Queuing, Fairness, Simulations


This paper compares four fair queuing disciplines that can be implemented on routers for congestion control and avoiding denial of services attacks. These are WFQ (Weighted Fair Queuing), WF2 Q+ (Worst-case Weighted Fair Queuing Plus), DRR (Deficit Round Robin) and CSFQ (Core-Stateless Fair Queuing). The relative performance of these algorithms in dealing with different traffic patterns under various network topologies is compared using simulations. According to the simulation results, WFQ and WF2 Q+ can achieve consistent good performance in terms of fairness. DRR and CSFQ require less computation, but need significant improvement to achieve the same level of fairness as WFQ. Especially, CSFQ, as a dropping (not scheduling) algorithm, has poor performance in a complex network.

Important Links:

Go Back