> On 16 Jan, 2016, at 11:05, Jonathan Morton <[email protected]> wrote: > > The opposite sense would be to have the side with the smaller number of hosts > govern the system. This would, I think, handle both the swarm and shard > cases better than the above, so I’ll see if I can think of a way to adapt the > algorithm to do that.
This turned out to be quite easy, going back to a slightly earlier (and happily simpler) version of the core algorithm. I did say that the details of incrementing the per-host counters were the major source of subtleties. https://github.com/dtaht/sch_cake/commit/2add740a79bb50b04e0497400a501df7b1857f48 - Jonathan Morton _______________________________________________ Cake mailing list [email protected] https://lists.bufferbloat.net/listinfo/cake
