[Cake] packet mass, ecn, and a fractional count

[Dave Taht]

from observing behaviors with large numbers of flows, fq_codel derived
algorithms start to struggle to achieve the desired delay, cake
seemingly less so, and perhaps this is related to collisions also.

A thought would be to use a fractional (fixed point) increment to
count rather than "1" when larger numbers of flows are present.

The original ns2 model started applying a slightly different fraction
to count in certain circumstances. It is quite doable in the 32 bit
int to reserve a few bits for a fixed point fraction (say, 4 bits),
but to apply it as the number of flows in play grows, not sure.

See also the tracy widom distribution.

-- 
Dave Täht
Open Networking needs **Open Source Hardware**

https://plus.google.com/u/0/+EricRaymond/posts/JqxCe2pFr67