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

[Aaron Wood <woody77@gmail.com>]

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

For the graphs, it would be great for f they were using a normalize output
that allows for easy comparisons between runs. Especially the y axis for
the “all” graph.
On Mon, Nov 27, 2017 at 15:55 Dave Taht <dave.taht@gmail.com> wrote:

> On Mon, Nov 27, 2017 at 3:16 PM, Martin Geddes <mail@martingeddes.com>
> wrote:
> > Hi Toke,
> >
> > The two critical references are this paper and this PhD thesis. The
> former
> > describes "cherish-urgency" multiplexing. The "cherish" is what is
> different
> > to today's scheduling. It is used to create a new class of algorithm
> whose
> > goal is global optimisation, not local optimisation (and global
> > pessimisation).
> >
> > The latter describes a paradigm change from "build it and then reason
> about
> > emergent performance" to "reason about engineered performance and then
> build
> > it". It works in practise, so whether it works in theory is left as an
> > exercise to the reader.
> >
> > The first step is to get the measurement right. I'm running a public
> > workshop in London on 8th Dec, and I am happy to accommodate anyone from
> > this list at our internal cost.
> >
> > Everyone working on AQM has done the best possible within the paradigm
> they
> > are operating. There is a bigger box of possibilities available, but it
> > needs you to engage with a paradigm change.
>
> We are currently benchmarking the known alternatives vs everything
> else via a dozen methods we understand.
>
> fq_codel v "cake":
>
>
> http://www.drhleny.cz/bufferbloat/cake/round1/eg_csrt_rrulbe_eg_fq_codel_200mbit/index.html
>
>
> http://www.drhleny.cz/bufferbloat/cake/round1/eg_csrt_rrulbe_eg_cakeeth_200mbit/index.html
>
> > Martin
> >
> > About me Free newsletter Company website Twitter Zoom My new start-up Not
> > LinkedIn Martin Geddes Consulting Ltd, Incorporated in Scotland, number
> > SC275827 VAT Number: 859 5634 72 Registered office: 17-1
> <https://maps.google.com/?q=mber:+859+5634+72+Registered+office:+17-1&entry=gmail&source=g>9
> East London
> > Street, Edinburgh, EH7 4BN
> >
> > On 26 November 2017 at 12:20, Toke Høiland-Jørgensen <toke@toke.dk>
> wrote:
> >>
> >> Martin Geddes <mail@martingeddes.com> writes:
> >>
> >> > It doesn't matter what scheduling algorithm you build if it creates
> >> > arbitrage or denial-of-service attacks that can arm a systemic
> >> > collapse hazard. The good news is we have a new class of scheduling
> >> > technology (that works on a different paradigm) that can fully address
> >> > all of the requirements. We are currently deploying it to enable the
> >> > world's first commercial quality-assured broadband service.
> >>
> >> Could you point to any research papers describing this technology? Would
> >> be interesting to read up on...
> >>
> >> -Toke
> >
> >
> >
> > _______________________________________________
> > Bloat mailing list
> > Bloat@lists.bufferbloat.net
> > https://lists.bufferbloat.net/listinfo/bloat
> >
>
>
>
> --
>
> Dave Täht
> CEO, TekLibre, LLC
> http://www.teklibre.com
> Tel: 1-669-226-2619
> _______________________________________________
> Bloat mailing list
> Bloat@lists.bufferbloat.net
> https://lists.bufferbloat.net/listinfo/bloat
>

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