Hi Dave,
well, I don't see DSCD as a competitor with cake or fq-pie. DSCD is not
primarily an aqm mechanism but its central objective is prioritizing ABE
traffic without harming BE traffic. This idea is more than 20 years old,
but scalable algorithms were not available, DSCD fills this gap.
On Tue, Aug 1, 2023 at 1:24 AM Michael Menth wrote:
>
> Hi all,
>
> here is a private copy for personal use:
>
> http://atlas.cs.uni-tuebingen.de/menth/papers/Menth21-Sub-6-accepted.pdf
Very interesting, thank you. So great you have code on github!
I appreciate the mention of cake, and I figure
Hi all,
here is a private copy for personal use:
http://atlas.cs.uni-tuebingen.de/menth/papers/Menth21-Sub-6-accepted.pdf
Kind regards
Michael
Am 01.08.2023 um 09:51 schrieb Sebastian Moeller:
Hi Michael,
that "teaser" you wrote is certainly interesting. Would you be able to
distribute
Hi Michael,
that "teaser" you wrote is certainly interesting. Would you be able to
distribute author copies to those of us that do not subscribe to IEEExplore,
please?
Regards
Sebastian
> On Aug 1, 2023, at 09:32, Michael Menth via Bloat
> wrote:
>
> Hi all,
>
> we've recently
Hi all,
we've recently developed a passive method for finding a link's capacity
(in a different context). You find the algorithm in III.B.5 in
https://ieeexplore.ieee.org/document/9954450
The approach ist tested in V.B for 1, 10, and 100 Gb/s links on a Linux
server and provides sufficiently
