This popped up in my Google Scholar mentions: https://arxiv.org/pdf/2010.08362
It proposes using a delay-based CC when FQ is present, and a loss-based when it isn't. It has a fairly straight-forward mechanism for detecting an FQ bottleneck: Start two flows where one has 2x the sending rate than the other, keep increasing their sending rate until both suffer losses, and observe the goodput at this point: If it's ~1:1 there's FQ, otherwise there isn't. They cite 98% detection accuracy using netns-based tests and sch_fq. -Toke _______________________________________________ Bloat mailing list [email protected] https://lists.bufferbloat.net/listinfo/bloat
