Re: [Bloat] Bufferbloat in high resolution + non-stationarity

[Jonathan Morton <chromatix99@gmail.com>]

[-- Attachment #1: Type: text/plain, Size: 1091 bytes --]

I read the paper just now, and skimmed through the thesis to determine that
it was talking about the same thing using an order of magnitude more space.

It boils down to a Diffserv implementation using a classifier (details
handwaved as usual), policers, shapers, and a strict-priority tail-dropping
queue.  The only noteworthy feature is that the position of the queue's
tail depends on the "cherish" metric of each traffic class, which is used
to provide differentiation in loss, leaving the strict-priority mechanism
to provide "urgency" (delay) differentiation.

From the above, you might reasonably conclude that I'm not very impressed.

The paper includes a test scenario versus a plain FIFO and a DRR system.
The DRR was weighted with a-priori knowledge of the relative traffic
volumes, which in fact would have degraded its performance in delay
management.  A DRR++ implementation *without* such knowledge would have
outperformed it substantially.

Toke, reproducing that test load and running it through an unmodified Cake
instance would perhaps be enlightening.

- Jonathan Morton

[-- Attachment #2: Type: text/html, Size: 1233 bytes --]