The Flow Queue CoDel Packet Scheduler and Active Queue Management Algorithm

This memo presents the FQ-CoDel hybrid packet scheduler and Active Queue Management (AQM) algorithm, a powerful tool for fighting bufferbloat and reducing latency. FQ-CoDel mixes packets from multiple flows and reduces the impact of head-of-line blocking from bursty traffic. It provides isolation for low-rate traffic such as DNS, web, and videoconferencing traffic. It improves utilisation across the networking fabric, especially for bidirectional traffic, by keeping queue lengths short, and it can be implemented in a memory- and CPU-efficient fashion across a wide range of hardware.

[1]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[2]  Mike H. MacGregor,et al.  Deficits for bursty latency-critical flows: DRR++ , 2000, Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium.

[3]  Paul E. McKenney,et al.  Stochastic fairness queueing , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[4]  Dario Rossi,et al.  Fighting the bufferbloat: On the coexistence of AQM and low priority congestion control , 2013, 2013 Proceedings IEEE INFOCOM.

[5]  Fabio Checconi,et al.  QFQ: Efficient Packet Scheduling With Tight Guarantees , 2013, IEEE/ACM Transactions on Networking.

[6]  Giovanna Carofiglio,et al.  On the Impact of TCP and Per-Flow Scheduling on Internet Performance , 2012, IEEE/ACM Transactions on Networking.

[7]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.