* [Codel] Fwd: Stanford Networking Seminar, Thursday, January 31st @ 11:45am, Dave Taht (Bufferbloat Project)
[not found] <CACct8e=Rxg+mkkcMnvutntORjwuB3aWM6u3BAQz5_6BfbPQWig@mail.gmail.com>
@ 2013-01-28 17:42 ` Dave Taht
0 siblings, 0 replies; only message in thread
From: Dave Taht @ 2013-01-28 17:42 UTC (permalink / raw)
To: codel, bloat, cerowrt-devel, bloat-announce
[-- Attachment #1: Type: text/plain, Size: 3326 bytes --]
As I've(we've) struggled to put down the fundamental concepts about
fq_codel in particular in the upcoming lwn piece...
It seemed like a good idea to try to explain codel, and fq_codel, in more
detail, with some new methods. So I'm giving a talk about it at Stanford,
on thursday - abstract and details as to the talk are below...
Attendees can be networking PhD students, professors, and engineers from
the industry.
Look forward to perhaps meeting some of you.
This talk is a successor to the talk I'd given in modena a few month's back
(youtube here:
http://www.youtube.com/watch?v=bi-jumVNVGk
)
While *this* talk will be filmed, I'm not sure if they'll let me bring the
gatorade into the Gates building.
---------- Forwarded message ----------
From: Yiannis Yiakoumis <yiannisy@stanford.edu>
Date: Mon, Jan 28, 2013 at 9:25 AM
Subject: Stanford Networking Seminar, Thursday, January 31st @ 11:45am,
Dave Taht (Bufferbloat Project)
To: netseminar <netseminar@lists.stanford.edu>
Stanford Networking Seminar Announcement
http://netseminar.stanford.edu/
Title: Inside Codel and Fq_codel and Derivatives in Delay Based active
queue management
When: 12:00-1:00pm, Thursday January 31st, 2013
Where: Gates 104
Lunch will be available at 11:45am.
About the talk:
Kathleen Nichols and Van Jacobson spent 14 years developing a successor to
RED, called "Codel". Even though well described in journals such as ACM
queue, and with commonly available source code, how the tightly intertwined
drop strategy and RTT estimator actually work is not well understood.
Furthermore the combination of various forms of Fair Queuing on top of any
AQM is not well understood.
This talk goes into detail of the current ns2 and Linux based code, while
discussing the design decisions and network traffic types we looked at
while designing them, and their predecessor (SFQRED) as well as touring
through a large selection of graphs and data from various real-world
simulations. It will also look into the known flaws of both codel and
fq_codel, and describe the ongoing research into
improvements.
About the speaker:
Dave Täht is the co-founder of the bufferbloat project. He is also architect
of the CeroWrt reference router project, which is exploring solutions
to the bufferbloat and ipv6 deployment problems on consumer hardware. He is
the
original implementor of the codel algorithm in Linux, as well as
maintainer of the ns2 and ns3 models of codel, and fq_codel. He
has developed nfq_codel and has multiple upcoming enhancements and
derivatives,
under test. To enhance testing of bufferbloat related fixes, is also
working on standardizing a "Realtime Response under Load" (RRUL) test suite.
Prior to tackling bufferbloat, he worked on wireless mesh networking,
spacecraft, VOIP, and embedded Linux, most notably as "Member, Visionary
staff"
for MontaVista software. He has been working on Unix derived systems for 34
years.
He is the CTO of Teklibre, LLC, and associated with the LINCS lab
in Paris, the Internet Systems Consortium (ISC), and his present work
is sponsored through the Comcast Technology Research & Development Fund.
--
Dave Täht
Fixing bufferbloat with cerowrt:
http://www.teklibre.com/cerowrt/subscribe.html
[-- Attachment #2: Type: text/html, Size: 5844 bytes --]
^ permalink raw reply [flat|nested] only message in thread