On 06/02/2016 00:10, Wesley Eddy wrote:
[...]
- Are the current couple of algorithms all that's needed for the Internet, or
are there other algorithms building on these, learning from experience with
them, or making other improvements which we should work on? (e.g. we have the
DualQ draft, and recently the GSP draft has been updated)
We recently implemented a hybrid FQ-PIE in FreeBSD's ipfw/dummynet context,
which might be something to evaluate/document more fully in the future?
(Our version boils down to gluing the FlowQueue hashing+newflow queue assignment
logic from FQ-CoDel with per-queue instances of PIE. Code went into
FreeBSD-CURRENT a few days ago,
https://svnweb.freebsd.org/base?view=revision&revision=300779. All being well,
the code will be in FreeBSD 11.0-RELEASE later this year.)
I know there was a Linux FQ-PIE proof-of-concept discussed here many moons ago,
but I don't know its current disposition.
cheers,
gja
_______________________________________________
aqm mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/aqm
