Papers › A Lower Bound on Latency Spikes for Capacity-Seeking Network Traffic

A Lower Bound on Latency Spikes for Capacity-Seeking Network Traffic

31 Oct 2021arXiv:2111.00488links table onlyarchive 2025-07-28

Bjørn Ivar Teigen, Neil Davies, Kai Olav Ellefsen, Tor Skeie, Carlo Augusto Grazia, Jim Torresen

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Most Internet traffic is carried by capacity-seeking protocols such as TCP and QUIC. Capacity-seeking protocols probe to find the maximum available throughput from sender to receiver, and, once they converge, attempt to keep sending traffic at this maximum rate. Achieving reliable low latency with capacity-seeking end-to-end methods is not yet entirely solved. We contribute a theoretical analysis to this ongoing discussion. In this work, we derive an expression for the minimum size of the spike in latency caused by a sudden drop in network capacity. Our results highlight a quantifiable and fundamental constraint on capacity-seeking network traffic. When end-to-end capacity is suddenly reduced, capacity-seeking traffic inevitably produces a latency spike. A lower bound on this latency spike can be calculated by multiplying the round-trip delay from the network bottleneck to the source of capacity-seeking traffic by the magnitude of the end-to-end capacity reduction. Testbed experiments show that this bound holds for the DCTCP, BBR, and Cubic congestion control algorithms. Our results have implications for the design of low-latency PHY and MAC-layer technologies because we quantify an important transport-layer consequence of unstable traffic rates.

PaperPDFCode

Code

bjornite/thesis-tcp-testbed officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections