Low latency via redundancy
Not on the map. Why?
Abstract (arXiv)
Low latency is critical for interactive networked applications. But while we know how to scale systems to increase capacity, reducing latency --- especially the tail of the latency distribution --- can be much more difficult. In this paper, we argue that the use of redundancy is an effective way to convert extra capacity into reduced latency. By initiating redundant operations across diverse resources and using the first result which completes, redundancy improves a system's latency even under exceptional conditions. We study the tradeoff with added system utilization, characterizing the situations in which replicating all tasks reduces mean latency. We then demonstrate empirically that replicating all operations can result in significant mean and tail latency reduction in real-world systems including DNS queries, database servers, and packet forwarding within networks.
Key facts. Cited by 2 papers in the map (data through 13 Oct 2026). First posted on arXiv 16 Jun 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 2.
2 papers.
- 2026ML-for-MLcited by 1
- 2026DynBranch: Speculative Subgraph Reuse for Dynamic Agentic LLM Servingcited by 0
- 2026DynBranch: Speculative Subgraph Reuse for Dynamic Agentic LLM Serving25 Sep 2026
- 2026ML-for-ML6 Aug 2026