Controlling queue delay

Speaker : Dave Taht
Pollere Inc.
Date: 20/07/2012
Time: 2:00 pm - 3:00 pm
Location: LINCS Meeting Room 40


Nearly three decades after it was first diagnosed, the persistently full buffer problem, recently exposed as part of bufferbloat is still with us and made increasingly critical by two trends. First, cheap memory and a more is better mentality have led to the inflation and proliferation of buffers. Second, dynamically varying path characteristics are much more common today and are the norm at the consumer Internet edge. Reasonably sized buffers become extremely oversized when link rates and path delays fall below nominal values.The solution for persistently full buffers, AQM (active queue management), has been known for two decades but has not been widely deployed because of implementation difficulties and general misunderstanding about Internet packet loss and queue dynamics. Unmanaged buffers are more critical today since buffer sizes are larger, delay-sensitive applications are more prevalent, and large (streaming) downloads common. The continued existence of extreme delays at the Internet edge can impact its usefulness and hamper the growth of new applications.This article aims to provide part of the bufferbloat solution, proposing an innovative approach to AQM suitable for today Internet called CoDel (for Controlled Delay,). This is a no-knobs AQM that adapts to changing link rates and is suitable for deployment and experimentation in Linux-based routers (as well as silicon).

Talk by Dave Taht on a recent ACM Queue paper by Kathleen Nichols, Pollere Inc.Van Jacobson, PARC (just google for the link)