Tag
tcp-reno
- Dec 4, 2025 Duplicate Acknowledgements and How a Sender Distinguishes Loss from Reordering Three duplicate ACKs are a heuristic for one lost segment, not a proof. Fast retransmit and fast recovery act on it, and the ambiguity with packet reordering shapes the whole design. networking
- Nov 3, 2025 RTT Fairness: Why Shorter Paths Win and How Algorithms Compensate Two flows on the same bottleneck with different round trips do not get equal shares, and the bias is a direct consequence of the control law. The fixes trade that bias against stability. networking
- Jan 21, 2025 Additive Increase, Multiplicative Decrease, and the Fairness of the Sawtooth Why the increase is additive and the decrease is multiplicative, how the resulting sawtooth converts loss rate into throughput, and where the convergence argument stops holding. networking