Minutes of ICCRG Meeting IETF 102, Montréal 13:30-15:30 Thursday 19th July 2018 13:40 Bob Briscoe and Joakim Misund Paced Chirping: Faster but less harmful slow start Neal Cardwell Google: What congestion control algorithm is this using? Bob & Joakim: DCTCP Aaron Falk, Akamai: Why is benefit more pronounced for large files? Bob & Joakim: Above 5MB file size the benefit flattens off Aaron Falk, Akamai: Does this require very precise clocks? Bob & Joakim: Yes, granularity of 1µs or better. Aaron Falk, Akamai: How does this compare to “packet pair”? Does it filter out noise? Bob & Joakim: It uses a simple algorithm to filter out noise. Ilpo Järvinen, University of Helsinki: I believe the noise on the public Internet would be too high for this to work Ian Swett, Google: Timestamps were removed from QUIC. What happens if a hop on the path has very shallow buffers and the rate is too high? Bob & Joakim: That’s the reason for the pauses between chirps. Mirja Kühlewind, ETH Zurich: How do you respond to loss? Bob & Joakim: The algorithm exits slow start -- 14:20 Roland Bless Policy-Oriented AQM Steering Neal Cardwell Google: Have you tried this with FQ-Codel instead of single-queue Codel? Roland Bless: No Bob Briscoe, CableLabs: Have you considered moving away from the idea of a target queueing delay altogether? Roland Bless: No -- 14:40 Neal Cardwell An Update on BBR Work at Google 15:05 Ian Swett BBR Startup Behavior Praveen Balasubramanian, Microsoft: Has BBR v2 been deployed in production yet? Neal Cardwell: No. Praveen Balasubramanian, Microsoft: Have you looked at things like Copa from MIT, for detecting when there are other flows, like Copa from MIT? Neal Cardwell: Yes, we are aware of Copa. -- 15:20 Ilpo Järvinen Fast-Slow RTO and CoAP Congestion Control (draft-jarvinen-core-fasor) Gorry Fairhurst, University of Aberdeen: Thanks for doing this work. This is very important. Gorry Fairhurst, University of Aberdeen: How much memory in a device is required per peer? Ilpo Järvinen: The logic is quite simple.