I just watched it. His assumption that "carrier networks can't solve the problem because they can't control the hosts" is JUST WRONG! The Internet solution is to require the flows' source hosts to regulate their transmission based on dynamic feedback. And this ignorance on his part is clearly his advisors' fault. The pattern here is: I make assumption that rules out better solutions. I then invent some complicated kludge "inside the network" and claim it solves the problem. Then I demand that networks put this kludge into the network. In other words, he takes an end-to-end problem (regulating source rates to achive low internal queue delay), and instead of implementing a solution at the ends, he adds much more complexity inside the network. Violating the whole end-to-end argument. Or, simplifying the point: "we have smarts in the routers, that we aren't using, so let's invent something to use them, even though there are better solutions." Yuck! This is how we ended up with CISC computers, with operating systems that shove huge amounts of function into protected mode with heavy use of shared global variables protected by complicated locks. OK, this creates the need for complicated PhD theses where the coolness is how complicated the code was to get working. On Saturday, December 4, 2021 1:44pm, "Dave Taht" <[email protected]> said:
> It was the conquest tool they referenced that really caught my eye > > https://www.youtube.com/watch?v=Q3FFzB0SUjc > > "ConQuest: Fine-Grained Queue Measurement in the Data Plane" > > On Fri, Dec 3, 2021 at 4:09 PM Jonathan Morton <[email protected]> > wrote: > > > > > On 4 Dec, 2021, at 12:27 am, Dave Taht <[email protected]> > wrote: > > > > > > > https://jonathankua.github.io/preprints/jkua-ieeelcn2021_understanding_ar_preprint-20jul2021.pdf > > > > > > I would love it if somehow the measured effects of chunklets against > cake's per-host/per flow fq was examined one day. > > > > I haven't actually measured it, but based on what the above paper says, I > > can > make some firm predictions: > > > > 1: When competing against traffic to the same local host, the performance > effects they describe will be present. > > > > 2: When competing against traffic to a different local-network host, the > performance effects they describe will be attenuated or even entirely absent. > > > > 3: They noted one or two cases of observable effects of hash collisions in > their tests with FQ-Codel. These will be greatly reduced in prevalence with > Cake, > due to the set-associative hash function which specifically addresses that > phenomenon. > > > > - Jonathan Morton > > > > -- > I tried to build a better future, a few times: > https://wayforward.archive.org/?site=https%3A%2F%2Fwww.icei.org > > Dave Täht CEO, TekLibre, LLC > _______________________________________________ > Cake mailing list > [email protected] > https://lists.bufferbloat.net/listinfo/cake >
_______________________________________________ Cake mailing list [email protected] https://lists.bufferbloat.net/listinfo/cake
