Overload Control for µs-scale RPCs with Breakwater
Inho Cho, Ahmed Saeed, Joshua Fried, Seo Jin Park, Mohammad Alizadeh, Adam Belay
Abstract
Modern datacenter applications are composed of hundreds of microservices with high degrees of fanout. As a result, they are sensitive to tail latency and require high request throughputs. Maintaining these characteristics under overload is difficult, especially for RPCs with short service times. In this paper, we consider the challenging case of microsecond-scale RPCs, where the cost of communicating information and dropping a request is similar to the cost of processing a request. We present Breakwater, an overload control scheme that can prevent overload in microsecond-scale services through a new, server-driven admission control scheme that issues credits based on server-side queueing delay. Breakwater contributes several techniques to amortize communication costs. It engages in demand speculation, where it assumes clients have unmet demand and issues additional credits when the server is not overloaded. Moreover, it piggybacks client-side demand information in RPC requests and credits in RPC responses. To cope with the occasional bursts in load caused by demand speculation, Breakwater drops requests when overloaded using active queue management. When clients' demand spikes unexpectedly to 1.4× capacity, Breakwater converges to stable performance in less than 20 ms with no congestion collapse while DAGOR and SEDA take 500 ms and 1.58 s to recover from congestion collapse, respectively.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 24247a2d-fb93-4305-b14b-03e3d3bd950eCited by top-tier papers22
- The Demikernel Datapath OS Architecture for Microsecond-scale Datacenter SystemsIrene Zhang, Amanda Raybuck, Pratyush Patel, Kirk Olynyk et al.SOSP 2021 · 83 citations
- Birds of a Feather Flock Together: Scaling RDMA RPCs with FlockSumit Kumar Monga, Sanidhya Kashyap, Changwoo MinSOSP 2021 · 34 citations
- Aequitas: admission control for performance-critical RPCs in datacentersYiwen Zhang, Gautam Kumar, Nandita Dukkipati, Xian Wu et al.SIGCOMM 2022 · 30 citations
- Remote Procedure Call as a Managed System ServiceJingrong Chen, Yongji Wu, Shihan Lin, Yechen Xu et al.NSDI 2023 · 30 citations
- eTran: Extensible Kernel Transport with eBPFZhongjie Chen, Qingkai Meng, ChonLam Lao, Yifan Liu et al.NSDI 2025 · 17 citations
Builds on1
Related papers
- Protego: Overload Control for Applications with Unpredictable Lock ContentionInho Cho, Ahmed Saeed, Seo Jin Park, Mohammad Alizadeh et al.NSDI 2023 · 11 citations
- Swift: Delay is Simple and Effective for Congestion Control in the DatacenterGautam Kumar, Nandita Dukkipati, Keon Jang, Hassan M. G. Wassel et al.SIGCOMM 2020 · 333 citations
- Rajomon: Decentralized and Coordinated Overload Control for Latency-Sensitive MicroservicesJiali Xing, Akis Giannoukos, Paul Loh, Shuyue Wang et al.NSDI 2025 · 12 citations
- The NEBULA RPC-Optimized ArchitectureMark Sutherland, Siddharth Gupta, Babak Falsafi, Virendra J. Marathe et al.ISCA 2020 · 29 citations
- TopFull: An Adaptive Top-Down Overload Control for SLO-Oriented MicroservicesJinwoo Park, Jaehyeong Park, Youngmok Jung, Hwijoon Lim et al.SIGCOMM 2024 · 10 citations
