[Cake] lanman2018 cake talk ideas
pete at heistp.net
Tue Jun 26 04:33:11 EDT 2018
> On Jun 26, 2018, at 8:58 AM, Dave Taht <dave.taht at gmail.com> wrote:
> I got about, I don't know, 5? problematic slides, and it needs to get
> to 20 by 9AM EDT, it's 3AM and I'm gonna catch some zs.
> On Fri, Jun 22, 2018 at 10:14 PM, Dave Taht <dave.taht at gmail.com> wrote:
>> I have to get on the plane tomorrow night at midnight and I've tried
>> to capture some of your comments and ideas in:
>> It's in its usual mess at this point - usually I don't share stuff
>> this raw! but I'm totally open to text suggestions, graphics, etc,
>> etc, etc - there's the plane flight and more than a few days left to
>> pound it into shape and after I get a feel for the conference monday
>> will end up doing another pass before the talk tuesday. What to say on
>> each slide is helpful (jokes appreciated, a lot of what I've had to
>> say so far is dripping with sarcasm which I know doesn't translate
>> I think focusing on per host fq is probably the strongest point to
>> develop and I kind of wanted a diagram of a whole bunch
>> of different host types and graphically illustrating what happens vs
>> fifo, fq_codel, and cake.
Sorry I’ve been heads down testing / writing. It looks like your challenge is 20 minutes for 3+ decades of info. Quick ideas to compress it:
1) Merge and reduce slides 9 (The case for per-host fair queueing) and 11 (The need for host and flow fairness)
2) Slide 14 (comparable to htb+fq_codel) could probably go? doesn’t sell compared to other stuff
3) Merge and reduce slides 17 (Deficit based shaping) and 18 (Achieving near perfect utilization) and reduce content
4) During the presentation, go through slides 1-8 quickly, but without dismissiveness
On the plus side, I think it’s good you re-focused this on fair queueing for this audience. Nice work.
Possible joke: “Tank, I need a pilot program for a B-212 helicopter, and for SQM and Cake..."
More information about the Cake