[aqm] paper: per flow fairness in a data center network

Dave Taht <dave.taht@gmail.com> Thu, 06 December 2018 03:19 UTC

MIME-Version: 1.0
From: Dave Taht <dave.taht@gmail.com>
Date: Wed, 05 Dec 2018 19:18:49 -0800
Message-ID: <CAA93jw58CW6We3NCa=F60yqvCPuvOexpRJQWS6M_k_5WnXUmhw@mail.gmail.com>
To: bloat <bloat@lists.bufferbloat.net>, Cake List <cake@lists.bufferbloat.net>, aqm@ietf.org
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Archived-At: <https://mailarchive.ietf.org/arch/msg/aqm/-wLeHNNYfm7RfoOt0bR-o8EYuWA>
Subject: [aqm] paper: per flow fairness in a data center network
Precedence: list

While I strongly agree with their premise:

"Multi-tenant DCNs cannot rely on specialized protocols and mechanisms
that assume single ownership and end-system compliance. It is
necessary rather to implement general, well-understood mechanisms
provided as a network service that require as few assumptions about DC
workload as possible."

... And there's a solid set of links to current work, and a very
interesting comparison to pfabric, their DCTCP emulation is too flawed
to be convincing, and we really should get around to making the ns2
fq_codel emulation fully match reality. This is also a scenario where
I'd like to see cake tried, to demonstrate the effectiveness (or not!)
of 8 way set associative queuing, cobalt, per host/per flow fq, etc,
vs some of the workloads they outline.

https://perso.telecom-paristech.fr/drossi/paper/rossi18hpsr.pdf

-- 

Dave Täht
CTO, TekLibre, LLC
http://www.teklibre.com
Tel: 1-831-205-9740

[aqm] paper: per flow fairness in a data center n… Dave Taht
Re: [aqm] paper: per flow fairness in a data cent… dario.rossi
Re: [aqm] [Cake] paper: per flow fairness in a da… Luca Muscariello
Re: [aqm] [Bloat] [Cake] paper: per flow fairness… Dave Taht
Re: [aqm] [Bloat] [Cake] paper: per flow fairness… Dave Taht