In this episode of PING, APNIC’s Chief Scientist Geoff Huston discusses the question of buffers, flow control and the ‘efficient’ use of a network link.
How do we maximize the use of a given network path, without knowing everything about its size along the way? It turns out, the story isn’t as simple as ‘more is better’ because sometimes, adding more memory to the system adds delay.
Modern TCP’s flow control algorithms are being modified to react to delay as well as loss and become more efficient at occupying the available space. At the same time, bit-marks inside the IP packet are modifying how end hosts can react to signals of congestion along the path. Are these two mechanisms in conflict? How do they stack up, and achieve critical mass in deployment?
Read more about TCP and flow control on the APNIC Blog. Here are some articles from the blog that discuss the issues:
- Comparing TCP and QUIC
- Does TCP keep pace with QUIC?
- TCP Congestion Signatures
- Striking a balance between bufferbloat and TCP queue oscillation
- TCP initial window configurations in the wild
- Underload: The future of congestion control
- Beyond bufferbloat: End-to-end congestion control cannot avoid latency spikes
- Congestion Control at IETF 110
Subscribe and share your story
You can stream and subscribe to PING via the following channels:
If you’re interested in sharing your insights or research, please get in touch — we’re always looking for great stories from the community. And please do let us know what you think of the podcast as well as the APNIC Blog so we can keep improving.
The views expressed by the authors of this blog are their own and do not necessarily reflect the views of APNIC. Please note a Code of Conduct applies to this blog.