research-article

Open access

Aequitas: admission control for performance-critical RPCs in datacenters

Authors:

Nandita Dukkipati,

Priyaranjan Jha,

Mosharaf Chowdhury,

Amin VahdatAuthors Info & Claims

SIGCOMM '22: Proceedings of the ACM SIGCOMM 2022 Conference

Pages 1 - 18

https://doi.org/10.1145/3544216.3544271

Published: 22 August 2022 Publication History

Abstract

With the increasing popularity of disaggregated storage and microservice architectures, high fan-out and fan-in Remote Procedure Calls (RPCs) now generate most of the traffic in modern datacenters. While the network plays a crucial role in RPC performance, traditional traffic classification categories cannot sufficiently capture their importance due to wide variations in RPC characteristics. As a result, meeting service-level objectives (SLOs), especially for performance-critical (PC) RPCs, remains challenging.

We present Aequitas, a distributed sender-driven admission control scheme that uses commodity Weighted-Fair Queuing (WFQ) to guarantee RPC-level SLOs. In the presence of network overloads, it enforces cluster-wide RPC latency SLOs by limiting the amount of traffic admitted into any given QoS and downgrading the rest. We show analytically and empirically that this simple scheme works well. When the network demand spikes beyond provisioned capacity, Aequitas achieves a latency SLO that is 3.8× lower than the state-of-art congestion control at the 99.9^th-p and admits up to 2× more PC RPCs meeting SLO when compared with pFabric, Qjump, D³, PDQ, and Homa. Results in our fleetwide production deployment show a 10% latency improvement.

Supplementary Material

PDF File (p1-zhang-supp.pdf)

Supplemental material.

Download
76.46 KB

References

[1]

Saksham Agarwal, Shijin Rajakrishnan, Akshay Narayan, Rachit Agarwal, David Shmoys, and Amin Vahdat. 2018. Sincronia: Near-optimal network design for coflows. In SIGCOMM.

Digital Library

[2]

Mohammad Alizadeh, Albert Greenberg, David A. Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, and Murari Sridharan. 2010. Data Center TCP (DCTCP). In SIGCOMM.

[3]

Mohammad Alizadeh, Shuang Yang, Milad Sharif, Sachin Katti, Nick Mckeown, Balaji Prabhakar, and Scott Shenker. 2013. pFabric: Minimal Near-Optimal Datacenter Transport. In SIGCOMM.

[4]

Sebastian Angel, Hitesh Ballani, Thomas Karagiannis, Greg O'Shea, and Eno Thereska. 2014. End-to-end Performance Isolation Through Virtual Datacenters. (2014).

[5]

Wei Bai, Li Chen, Kai Chen, Dongsu Han, Chen Tian, and Hao Wang. 2015. Information-Agnostic Flow Scheduling for Commodity Data Centers. In NSDI.

[6]

Hitesh Ballani, Paolo Costa, Thomas Karagiannis, and Ant Rowstron. 2011. Towards predictable datacenter networks. In SIGCOMM.

[7]

Hitesh Ballani, Keon Jang, Thomas Karagiannis, Changhoon Kim, Dinan Gunawardena, and Greg O'Shea. 2013. Chatty tenants and the cloud network sharing problem. In NSDI.

[8]

Nikhil Bansal and Mor Harchol-Balter. 2001. Analysis of SRPT Scheduling: Investigating Unfairness. In Proceedings of the 2001 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '01). Association for Computing Machinery, New York, NY, USA, 279--290.

Digital Library

[9]

J.C.R. Bennett and H. Zhang. 1996. WF²Q: Worst-case Fair Weighted Fair Queueing. In INFOCOM.

[10]

S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. 1998. RFC2475: An Architecture for Differentiated Service. In IETF.

[11]

Dah-Ming Chiu and Raj Jain. 1989. Analysis of Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks. In Computer Networks and ISDN systems.

[12]

Inho Cho, Ahmed Saeed, Joshua Fried, Seo Jin Park, Mohammad Alizadeh, and Adam Belay. 2020. Overload Control for μs-scale RPCs with Breakwater. In NSDI.

[13]

Mosharaf Chowdhury, Zhenhua Liu, Ali Ghodsi, and Ion Stoica. 2016. HUG: Multi-Resource fairness for correlated and elastic demands. In NSDI.

Digital Library

[14]

Mosharaf Chowdhury and Ion Stoica. 2015. Efficient Coflow Scheduling Without Prior Knowledge. In SIGCOMM.

[15]

Mosharaf Chowdhury, Yuan Zhong, and Ion Stoica. 2014. Efficient Coflow Scheduling with Varys. In SIGCOMM.

[16]

Jeremy Cloud. 2013. Decomposing twitter: Adventures in serviceoriented architecture. In n QCon New York.

[17]

Rene L. Cruz. 1991. A calculus for network delay, Part I: Network elements in isolation. In IEEE/ACM Transactions on Information Theory.

[18]

Rene L Cruz. 1992. Service burstiness and dynamic burstiness measures: A framework. Journal of High Speed Networks 1, 2 (1992), 105--127.

Digital Library

[19]

A. Demers, S. Keshav, and S. Shenker. 1989. Analysis and Simulation of a Fair Queueing Algorithm. In SIGCOMM.

[20]

Fahad Dogar, Thomas Karagiannis, Hitesh Ballani, and Ant Rowstron. 2014. Decentralized Task-Aware Scheduling for Data Center Networks. In SIGCOMM.

[21]

Abdullah Bin Faisal, Hafiz Mohsin Bashir, Ihsan Ayyub Qazi, Zartash Uzmi, and Fahad R. Dogar. 2018. Workload Adaptive Flow Scheduling. In CoNEXT.

[22]

Sally Floyd and Van Jacobson. 1993. Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Transaction on Networking 1, 4 (1993), 397--1413.

Digital Library

[23]

Peter X. Gao, Akshay Narayan, Gautam Kumar, Rachit Agarwal, Sylvia Ratnasamy, and Scott Shenker. 2015. pHost: Distributed Near-Optimal Datacenter Transport Over Commodity Network Fabric. In CoNEXT.

[24]

S. Jamaloddin Golestani. 1995. Network delay analysis of a class of fair queueing algorithms. IEEE JSAC 13, 6 (1995), 1057--1070.

[25]

Pawan Goyal, Harrick M Vin, and Haichen Chen. 1996. Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks. In SIGCOMM.

[26]

Matthew P. Grosvenor, Malte Schwarzkopf, Ionel Gog, Robert N. M. Watson, Andrew W. Moore, Steven Hand, and Jon Crowcroft. 2015. Queues don't matter when you can JUMP them!. In NSDI.

[27]

Chuanxiong Guo, Guohan Lu, Helen J Wang, Shuang Yang, Chao Kong, Peng Sun, Wenfei Wu, and Yongguang Zhang. 2010. SecondNet: A data center network virtualization architecture with bandwidth guarantees. In CoNEXT.

[28]

Chi-Yao Hong, Matthew Caesar, and P. Brighten Godfrey. 2012. Finishing Flows Quickly with Preemptive Scheduling. In SIGCOMM.

[29]

Chi-Yao Hong, Srikanth Kandula, Ratul Mahajan, Ming Zhang, Vijay Gill, Mohan Nanduri, and Roger Wattenhofer. 2013. Achieving high utilization with software-driven WAN. In SIGCOMM.

[30]

Van Jacobson and Michael J. Karels. 1988. Congestion Avoidance and Control. In SIGCOMM.

[31]

Keon Jang, Justine Sherry, Hitesh Ballani, and Toby Moncaster. 2015. Silo: Predictable message latency in the cloud. In SIGCOMM.

Digital Library

[32]

Vimalkumar Jeyakumar, Mohammad Alizadeh, David Mazieres, Balaji Prabhakar, Changhoon Kim, and Albert Greenberg. 2013. EyeQ: Practical Network Performance Isolation at the Edge. In NSDI.

[33]

Alok Kumar, Sushant Jain, Uday Naik, Nikhil Kasinadhuni, Enrique Cauich Zermeno, C. Stephen Gunn, Jing Ai, Bjorn Carlin, Mihai Amarandei-Stavila, Mathieu Robin, Aspi Siganporia, Stephen Stuart, and Amin Vahdat. 2015. BwE: Flexible, Hierarchical Bandwidth Allocation for WAN Distributed Computing. In SIGCOMM.

[34]

Gautam Kumar, Nandita Dukkipati, Keon Jang, Hassan M. G Wassel, Xian Wu, Behnam Montazeri, Yaogong Wang, Kevin Springborn, Christopher Alfeld, Michael Ryan, David Wetherall, and Amin Vahdat. 2020. Swift: Delay is Simple and Effective for Congestion Control in the Datacenter. In SIGCOMM.

[35]

Gautam Kumar, Akshay Narayan, and Peter Gao. 2016. YAAPS: Yet Another Packet Simulator. https://github.com/NetSys/simulator. (2016).

[36]

Yuliang LI, Harry Hongqiang Liu, Yan Zhuang, Fei Feng, Lingbo Tang, Zheng Cao, Ming Zhang, Frank Kelly, Mohammad Alizadeh, and Minlan Yu. 2019. HPCC: High Precision Congestion Control. In SIGCOMM.

[37]

John D. C. Little. 1961. A proof for the queuing formula: L=λW. In Operations Research.

[38]

Tony Mauro. 2015. Adopting Microservices at Netflix: Lessons for Architectural Design. https://tinyurl.com/htfezlj. (2015).

[39]

Radhika Mittal, Nandita Dukkipati, Emily Blem, Hassan Wassel, Monia Ghobadi, Amin Vahdat, Yaogong Wang, David Wetherall, and David Zats. 2015. TIMELY: RTT-based Congestion Control for the Datacenter. In SIGCOMM.

Digital Library

[40]

Behnam Montazeri, Yilong Li, Mohammad Alizadeh, and John Ousterhout. 2018. Homa: A Receiver-Driven Low-Latency Transport Protocol Using Network Priorities. In SIGCOMM.

Digital Library

[41]

Kanthi Nagaraj, Dinesh Bharadia, Hongzi Mao, Sandeep Chinchali, Mohammad Alizadeh, and Sachin Katti. 2016. NUMFabric: Fast and Flexible Bandwidth Allocation in Datacenters. In SIGCOMM.

[42]

Kathleen Nichols and Van Jacobson. 2012. Controlling Queue Delay: A modern AQM is just one piece of the solution to bufferbloat. In ACM Queue.

[43]

Amy Ousterhout, Jonathan Perry, Hari Balakrishnan, and Petr Lapukhov. 2017. Flexplane: An experimentation platform for resource management in datacenters. In NSDI.

[44]

Dan Paik. 2016. Adapt or Die: A microservices story at Google. https://www.slideshare.net/apigee/adapt-or-die-a-microservices-story-at-google. (2016).

[45]

Rong Pan, Lee Breslau, Balaji Prabhakar, and Scott Shenker. 2003. Approximate Fairness through Differential Dropping. In SIGCOMM.

[46]

Rong Pan, Balaji Prabhakar, and Konstantinos Psounis. 2000. CHOKe: A stateless active queue management scheme for approximating fair bandwidth allocation. In INFOCOM.

[47]

Abhay K. Parekh and Robert G. Gallager. 1993. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case. In IEEE/ACM Transactions on Networking.

[48]

Jonathan Perry, Amy Ousterhout, Hari Balakrishnan, Devavrat Shah, and Hans Fugal. 2014. Fastpass: A centralized zero-queue datacenter network. (2014).

Digital Library

[49]

L. Popa, G. Kumar, M. Chowdhury, A. Krishnamurthy, S. Ratnasamy, and I. Stoica. 2012. FairCloud: Sharing the Network in Cloud Computing. In SIGCOMM.

[50]

Lucian Popa, Praveen Yalagandula, Sujata Banerjee, Jeffrey C. Mogul, Yoshio Turner, and Jose Renato Santos. 2013. ElasticSwitch: Practical Work-Conserving Bandwidth Guarantees for Cloud Computing. In SIGCOMM.

[51]

Hanrijanto Sariowan, Rene L. Cruz, and George C. Polyzos. 1999. SCED: A Generalized Scheduling Policy for Guaranteeing Quality-of-Service. In IEEE/ACM Transactions on Networking.

[52]

Cristian Satnic. 2016. Amazon, Microservices and the birth of AWS cloud computing. https://www.linkedin.com/pulse/amazon-microservices-birth-aws-cloud-computing-cristian-satnic/. (2016).

[53]

Alan Shieh, Srikanth Kandula, Albert Greenberg, and Changhoon Kim. 2011. Sharing the Data Center Network. In NSDI.

[54]

Madhavapeddi Shreedhar and George Varghese. 1995. Efficient fair queueing using deficit round robin. In SIGCOMM.

[55]

David Shue, Michael J. Freedman, and Anees Shaikh. 2012. Performance Isolation and Fairness for Multi-Tenant Cloud Storage. (2012).

[56]

Benjamin H. Sigelman, Luiz Andre Barroso, Mike Burrows, Pat Stephenson, Manoj Plakal, Donald Beaver, Saul Jaspan, and Chandan Shanbhag. 2010. Dapper, a Large-Scale Distributed Systems Tracing Infrastructure. Technical Report. Google, Inc. https://research.google.com/archive/papers/dapper-2010-1.pdf

[57]

Ion Stoica, Hui Zhang, and TS Ng. 1997. A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services. In SIGCOMM.

[58]

Eno Thereska, Hitesh Ballani, Greg O'Shea, Thomas Karagiannis, Ant Rowstron, Tom Talepy, Richard Black, and Timothy Zhu. 2013. IOFlow: A Software-Defined Storage Architecture. In SOSP.

[59]

Andrew Wang, Shivaram Venkataraman, Sara Alspaugh, Randy Katz, and Ion Stoica. 2012. Cake: enabling high-level SLOs on shared storage systems. In SoCC.

[60]

Xiao-Dong Wang, Xiao Chen, Jie Min, and Yu Zhou. 2012. A Priority-Based Weighted Fair Queueing Algorithm in Wireless Sensor Network. In WiCom.

[61]

Matt Welsh and David Culler. 2002. Overload Management as a Fundamental Service Design Primitive. In SIGOPS.

[62]

Christo Wilson, Hitesh Ballani, Thomas Karagiannis, and Ant Rowstron. 2011. Better Never than Late: Meeting Deadlines in Datacenter Networks. In SIGCOMM.

[63]

J. Wroclawski. 1997. RFC 2210: The Use of RSVP with IETF Integrated Services. In IETF.

[64]

David Zats, Anand Padmanabha Iyer, Ganesh Anantharayanan, Rachit Agarwal, Randy Katz, Ion Stoica, and Amin Vahdat. 2015. FastLane: Making Short Flows Shorter with Agile Drop Notification. In SOCC.

[65]

Hao Zhou, Ming Chen, Qian Lin, Yong Wang, Xiaobin She, Sifan Liu, Rui Gu, Beng Chin Ooi, and Junf. 2018. Overload Control for Scaling WeChat Microservices. In SoCC.

[66]

Timothy Zhu, Daniel S. Berger, and Mor Harchol-Balter. 2016. SNC-Meister: Admitting More Tenants with Tail Latency SLOs. In SoCC.

[67]

Timothy Zhu, Michael A. Kozuch, and Mor Harchol-Balter. 2017. WorkloadCompactor: Reducing datacenter cost while providing tail latency SLO guarantees. In SoCC.

[68]

Timothy Zhu, Alexey Tumanov, Michael A. Kozuch, Mor Harchol-Balter, and Gregory R. Ganger. 2014. PriorityMeister: Tail Latency QoS for Shared Networked Storage. In SoCC.

[69]

Yibo Zhu, Haggai Eran, Daniel Firestone, Chuanxiong Guo, Marina Lipshteyn, Yehonatan Liron, Jitendra Padhye, Shachar Raindel, Mohamad Haj Yahia, and Ming Zhang. 2015. Congestion control for large-scale RDMA deployments. In SIGCOMM.

Cited By

Zhou HHu DZhou ZYuan GDong D(2024)DDT: Dynamical Selective Dropping Threshold for Reactive Congestion ControlProceedings of the ACM Turing Award Celebration Conference - China 202410.1145/3674399.3674412(12-17)Online publication date: 5-Jul-2024
https://dl.acm.org/doi/10.1145/3674399.3674412
Park JPark JJung YLim HYeo HHan DSekar VYu MSeneviratne AVeitch D(2024)TopFull: An Adaptive Top-Down Overload Control for SLO-Oriented MicroservicesProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672253(876-890)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3651890.3672253
Qi SJin CChowdhury MLiu ZLiu XJin X(2024)Pyxis: Scheduling Mixed Tasks in Disaggregated DatacentersIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.341862035:9(1536-1550)Online publication date: Sep-2024
https://doi.org/10.1109/TPDS.2024.3418620
Show More Cited By

Index Terms

Aequitas: admission control for performance-critical RPCs in datacenters
1. Networks

Recommendations

Video multicasting in an autonomic future internet with essentially-perfect throughput and QoS guarantees
NEW2AN'11/ruSMART'11: Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking

A framework for an Autonomic Future Internet which supports 2 services classes, the Essentially-Perfect QoS (QoS) class and the Best-Effort (BE) class, is proposed. All provisioned traffic flows in the QoS class can achieve 100% throughput and ...
Robust network dimensioning for realtime services over IP networks with traffic deviation

Network planning for realtime services in traditional systems is normally performed based on a fixed traffic demand. Realtime services such as voice and video are currently being widely deployed over packet-based IP networks. Due to the lack of resource ...
Dynamic management of quality of service with priority for multimedia multicasting

We propose a receiver-oriented resource reservation mechanism, called dynamic management of QoS with priority (DMQP), for multimedia multicasting over the internet that provides quality of service (QoS) guarantees with service differentiation for ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '22: Proceedings of the ACM SIGCOMM 2022 Conference

August 2022

858 pages

ISBN:9781450394208

DOI:10.1145/3544216

General Chairs:
Fernando Kuipers
Delft University of Technology
,
Ariel Orda
Technion Israel Institute of Technology

Copyright © 2022 Owner/Author.

This work is licensed under a Creative Commons Attribution International 4.0 License.

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 August 2022

Check for updates

Badges

Author Tags

Qualifiers

Research-article

Funding Sources

NSF (National Science Foundation)

Conference

SIGCOMM '22

Sponsor:

SIGCOMM

SIGCOMM '22: ACM SIGCOMM 2022 Conference

August 22 - 26, 2022

Amsterdam, Netherlands

Acceptance Rates

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
4,687
Total Downloads

Downloads (Last 12 months)1,308
Downloads (Last 6 weeks)120

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhou HHu DZhou ZYuan GDong D(2024)DDT: Dynamical Selective Dropping Threshold for Reactive Congestion ControlProceedings of the ACM Turing Award Celebration Conference - China 202410.1145/3674399.3674412(12-17)Online publication date: 5-Jul-2024
https://dl.acm.org/doi/10.1145/3674399.3674412
Park JPark JJung YLim HYeo HHan DSekar VYu MSeneviratne AVeitch D(2024)TopFull: An Adaptive Top-Down Overload Control for SLO-Oriented MicroservicesProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672253(876-890)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3651890.3672253
Qi SJin CChowdhury MLiu ZLiu XJin X(2024)Pyxis: Scheduling Mixed Tasks in Disaggregated DatacentersIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.341862035:9(1536-1550)Online publication date: Sep-2024
https://doi.org/10.1109/TPDS.2024.3418620
Lim KGiordano MStavrinos TZhang INelson JKasikci BAnderson T(2024)Beehive: A Flexible Network Stack for Direct-Attached Accelerators2024 57th IEEE/ACM International Symposium on Microarchitecture (MICRO)10.1109/MICRO61859.2024.00037(393-408)Online publication date: 2-Nov-2024
https://doi.org/10.1109/MICRO61859.2024.00037
Serracanta BGao KRos-Giralt JRodriguez-Natal AContreras LYang RCabellos A(2024)Toward Deep Application-Network Integration: Architectures, Progress and OpportunitiesIEEE Communications Magazine10.1109/MCOM.004.230069362:12(128-134)Online publication date: Dec-2024
https://doi.org/10.1109/MCOM.004.2300693
Serracanta BRodriguez-Natal AMaino FCabellos-Aparicio A(2024)Flow Optimization at Inter-Datacenter Networks for Application Run-time AccelerationICC 2024 - IEEE International Conference on Communications10.1109/ICC51166.2024.10623094(2670-2675)Online publication date: 9-Jun-2024
https://doi.org/10.1109/ICC51166.2024.10623094
Quttoum AAlsarhan AMoh’d AAlshareet ONawaf SKhasawneh FAljaidi MAlshammari MAwasthi A(2023)ABLA: Application-Based Load-Balanced Approach for Adaptive Mapping of Datacenter NetworksElectronics10.3390/electronics1217368912:17(3689)Online publication date: 31-Aug-2023
https://doi.org/10.3390/electronics12173689
Zadeh SMunir ABahnasy MKetabi SGanjali Y(2023)On Augmenting TCP/IP Stack via eBPFProceedings of the 1st Workshop on eBPF and Kernel Extensions10.1145/3609021.3609300(15-20)Online publication date: 10-Sep-2023
https://dl.acm.org/doi/10.1145/3609021.3609300
Al Maruf HChowdhury M(2023)Memory Disaggregation: Advances and Open ChallengesACM SIGOPS Operating Systems Review10.1145/3606557.360656257:1(29-37)Online publication date: 28-Jun-2023
https://dl.acm.org/doi/10.1145/3606557.3606562
Zhang TSharma UKapritsos M(2023)Performal: Formal Verification of Latency Properties for Distributed SystemsProceedings of the ACM on Programming Languages10.1145/35912357:PLDI(368-393)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591235
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents