Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3544216.3544240acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article

Cebinae: scalable in-network fairness augmentation

Published: 22 August 2022 Publication History

Abstract

For public networks like the Internet and those of many clouds, end-host applications can use any congestion control protocol they wish. This protocol diversity and application autonomy are only increasing over time. While in-network support for fairness is an attractive solution for reigning in the inequity, existing solutions still have difficulty scaling to today's networks using today's devices. In this paper, we present Cebinae, a mechanism for augmenting existing networks of legacy hosts with penalties for flows that exceed their max-min fair share. Cebinae is compatible with all of the congestion control protocols in today's Internet, is deployable on commodity programmable switches, and scales orders of magnitude beyond existing alternatives.

Supplementary Material

PDF File (p219-yu-supp.pdf)
Supplemental material.

References

[1]
2022. The Flow Queue CoDel Packet Scheduler and Active Queue Management Algorithm. https://datatracker.ietf.org/doc/html/rfc8290. (January 2022).
[2]
2022. FQ-CoDel. https://www.nsnam.org/docs/release/3.35/models/html/fq-codel.html. (January 2022).
[3]
2022. Network Simulator 3. https://www.nsnam.org. (January 2022).
[4]
Guido Appenzeller, Isaac Keslassy, and Nick McKeown. 2004. Sizing Router Buffers. SIGCOMM Comput. Commun. Rev. 34, 4 (aug 2004), 281--292.
[5]
Venkat Arun and Hari Balakrishnan. 2018. Copa: Practical {Delay-Based} Congestion Control for the Internet. In 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18). 329--342.
[6]
Andrea Baiocchi, Angelo P Castellani, and Francesco Vacirca. 2007. YeAH-TCP: yet another highspeed TCP. In Proc. PFLDnet, Vol. 7. 37--42.
[7]
Ran Ben-Basat, Xiaoqi Chen, Gil Einziger, and Ori Rottenstreich. 2018. Efficient measurement on programmable switches using probabilistic recirculation. In 2018 IEEE 26th International Conference on Network Protocols (ICNP). IEEE, 313--323.
[8]
Jean-Yves Le Boudec. 2021. Rate adaptation, Congestion Control and Fairness: A Tutorial. https://leboudec.github.io/leboudec/resources/tutorial.html. (November 2021).
[9]
Lawrence S Brakmo, Sean W O'Malley, and Larry L Peterson. 1994. TCP Vegas: New techniques for congestion detection and avoidance. In Proceedings of the conference on Communications architectures, protocols and applications. 24--35.
[10]
Bob Briscoe. 2007. Flow rate fairness: Dismantling a religion. ACM SIGCOMM Computer Communication Review 37, 2 (2007), 63--74.
[11]
Lloyd Brown, Ganesh Ananthanarayanan, Ethan Katz-Bassett, Arvind Krishnamurthy, Sylvia Ratnasamy, Michael Schapira, and Scott Shenker. 2020. On the future of congestion control for the public internet. In Proceedings of the 19th ACM Workshop on Hot Topics in Networks. 30--37.
[12]
Caida. 2022. The CAIDA UCSD Statistical information for the CAIDA Anonymized Internet Traces. https://www.caida.org/data/passive/passive_trace_statistics.xml. (2022).
[13]
Carlo Caini and Rosario Firrincieli. 2004. TCP Hybla: a TCP enhancement for heterogeneous networks. International journal of satellite communications and networking 22, 5 (2004), 547--566.
[14]
Neal Cardwell, Yuchung Cheng, C. Stephen Gunn, Soheil Hassas Yeganeh, and Van Jacobson. 2016. BBR: Congestion-Based Congestion Control. ACM Queue 14, September-October (2016), 20 -- 53. http://queue.acm.org/detail.cfm?id=3022184
[15]
Neal Cardwell, Yuchung Cheng, S Hassas Yeganeh, and Van Jacobson. 2017. BBR congestion control. Working Draft, IETF Secretariat, Internet-Draft draft-cardwell-iccrg-bbr-congestion-control-00 (2017).
[16]
Dah-Ming Chiu and Raj Jain. 1989. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN systems 17, 1 (1989), 1--14.
[17]
A. Demers, S. Keshav, and S. Shenker. 1989. Analysis and Simulation of a Fair Queueing Algorithm. SIGCOMM Comput. Commun. Rev. 19, 4 (aug 1989), 1--12.
[18]
Nandita Dukkipati, Masayoshi Kobayashi, Rui Zhang-Shen, and Nick McKeown. 2005. Processor Sharing Flows in the Internet. In Proceedings of the 13th International Conference on Quality of Service (IWQoS'05). Springer-Verlag, Berlin, Heidelberg, 271--285.
[19]
S Floyd. 2008. RFC 5348 TCP-Friendly Rate Control (TFRC) Protocol Specification. RFC 5348 Proposed Standard (2008).
[20]
Cheng Peng Fu and Soung C Liew. 2003. TCP Veno: TCP enhancement for transmission over wireless access networks. IEEE Journal on selected areas in communications 21, 2 (2003), 216--228.
[21]
Manfred Georg, Christoph Jechlitschek, and Sergey Gorinsky. 2007. Improving individual flow performance with multiple queue fair queuing. In 2007 Fifteenth IEEE International Workshop on Quality of Service. IEEE, 141--144.
[22]
Sergey Gorinsky and Christoph Jechlitschek. 2007. Fair efficiency, or low average delay without starvation. In 2007 16th International Conference on Computer Communications and Networks. IEEE, 424--429.
[23]
Sergey Gorinsky and Harrick Vin. 2008. Effairness: Dealing with Time in Congestion Control Evaluation. In Fourth International Conference on Networking and Services (icns 2008). IEEE, 40--45.
[24]
Sangtae Ha, Injong Rhee, and Lisong Xu. 2008. CUBIC: A New TCP-Friendly High-Speed TCP Variant. SIGOPS Oper. Syst. Rev. 42, 5 (jul 2008), 64--74.
[25]
Mario Hock, Roland Bless, and Martina Zitterbart. 2017. Experimental evaluation of BBR congestion control. In 2017 IEEE 25th International Conference on Network Protocols (ICNP). IEEE, 1--10.
[26]
Raj Jain, Arjan Durresi, and Gojko Babic. 1999. Throughput fairness index: An explanation. In ATM Forum contribution, Vol. 99.
[27]
Rajendra K Jain, Dah-Ming W Chiu, William R Hawe, et al. 1984. A quantitative measure of fairness and discrimination. Eastern Research Laboratory, Digital Equipment Corporation, Hudson, MA 21 (1984).
[28]
Lavanya Jose, Stephen Ibanez, Mohammad Alizadeh, and Nick McKeown. 2019. A distributed algorithm to calculate max-min fair rates without per-flow state. Proceedings of the ACM on Measurement and Analysis of Computing Systems 3, 2 (2019), 1--42.
[29]
Dina Katabi, Mark Handley, and Charlie Rohrs. 2002. Congestion Control for High Bandwidth-Delay Product Networks. In Proceedings of the 2002 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM '02). Association for Computing Machinery, New York, NY, USA, 89--102.
[30]
F. Kaudel. 1998. ATM Forum Performance Testing Specification Draft. https://www.broadband-forum.org/technical/download/af-test-tm-0131.000.pdf. (December 1998).
[31]
Frank P Kelly, Aman K Maulloo, and David Kim Hong Tan. 1998. Rate control for communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research society 49, 3 (1998), 237--252.
[32]
Tom Kelly. 2003. Scalable TCP: Improving performance in highspeed wide area networks. ACM SIGCOMM computer communication Review 33, 2 (2003), 83--91.
[33]
Xin Zhe Khooi, Levente Csikor, Jialin Li, Min Suk Kang, and Dinil Mon Divakara. 2021. Revisiting Heavy-Hitter Detection on Commodity Programmable Switches. In 2021 IEEE 7th International Conference on Network Softwarization (NetSoft). IEEE, 79--87.
[34]
Yiran Lei, Liangcheng Yu, Vincent Liu, and Mingwei Xu. 2022. PrintQueue: Performance Diagnosis via Queue Measurement in the Data Plane. In Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication (SIGCOMM '22). Association for Computing Machinery, Amsterdam, Netherlands.
[35]
Douglas Leith and Robert Shorten. 2004. H-TCP: TCP for high-speed and longdistance networks. In Proceedings of PFLDnet, Vol. 2004.
[36]
Shao Liu, Tamer Başar, and Ravi Srikant. 2008. TCP-Illinois: A loss-and delay-based congestion control algorithm for high-speed networks. Performance Evaluation 65, 6--7 (2008), 417--440.
[37]
Jonathan Mace, Peter Bodik, Rodrigo Fonseca, and Madanlal Musuvathi. 2015. Retro: Targeted resource management in multi-tenant distributed systems. In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15). 589--603.
[38]
Ratul Mahajan, Sally Floyd, and David Wetherall. 2001. Controlling high-bandwidth flows at the congested router. In Proceedings Ninth International Conference on Network Protocols. ICNP 2001. 192--201.
[39]
John Nagle. 1987. On Packet Switches with Infinite Storage. IEEE Transactions on Communications 35, 4 (1987), 435--438.
[40]
Jitendra Padhye, Victor Firoiu, Don Towsley, and Jim Kurose. 1998. Modeling TCP throughput: A simple model and its empirical validation. In Proceedings of the ACM SIGCOMM'98 conference on Applications, technologies, architectures, and protocols for computer communication. 303--314.
[41]
Rong Pan, Lee Breslau, Balaji Prabhakar, and Scott Shenker. 2003. Approximate Fairness through Differential Dropping. SIGCOMM Comput. Commun. Rev. 33, 2 (apr 2003), 23--39.
[42]
Abhay K Parekh and Robert G Gallager. 1993. A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM transactions on networking 1, 3 (1993), 344--357.
[43]
Larry L Peterson and Bruce S Davie. 2007. Computer networks: a systems approach. Elsevier.
[44]
Adithya Abraham Philip, Ranysha Ware, Rukshani Athapathu, Justine Sherry, and Vyas Sekar. 2021. Revisiting TCP Congestion Control Throughput Models & Fairness Properties at Scale. Association for Computing Machinery, New York, NY, USA, 96--103.
[45]
Lucian Popa, Gautam Kumar, Mosharaf Chowdhury, Arvind Krishnamurthy, Sylvia Ratnasamy, and Ion Stoica. 2012. FairCloud: Sharing the network in cloud computing. In Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication. 187--198.
[46]
Dominik Scholz, Benedikt Jaeger, Lukas Schwaighofer, Daniel Raumer, Fabien Geyer, and Georg Carle. 2018. Towards a Deeper Understanding of TCP BBR Congestion Control. In 2018 IFIP Networking Conference (IFIP Networking) and Workshops. 1--9.
[47]
Naveen Kr. Sharma, Ming Liu, Kishore Atreya, and Arvind Krishnamurthy. 2018. Approximating Fair Queueing on Reconfigurable Switches. In 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18). USENIX Association, Renton, WA, 1--16. https://www.usenix.org/conference/nsdi18/presentation/sharma
[48]
Naveen Kr. Sharma, Chenxingyu Zhao, Ming Liu, Pravein G Kannan, Changhoon Kim, Arvind Krishnamurthy, and Anirudh Sivaraman. 2020. Programmable Calendar Queues for High-speed Packet Scheduling. In 17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20). USENIX Association, Santa Clara, CA, 685--699. https://www.usenix.org/conference/nsdi20/presentation/sharma
[49]
Vibhaalakshmi Sivaraman, Srinivas Narayana, Ori Rottenstreich, S. Muthukrishnan, and Jennifer Rexford. 2017. Heavy-Hitter Detection Entirely in the Data Plane. In Proceedings of the Symposium on SDN Research (SOSR '17). Association for Computing Machinery, New York, NY, USA, 164--176.
[50]
John Sonchack, Devon Loehr, Jennifer Rexford, and David Walker. 2021. Lucid: A language for control in the data plane. In Proceedings of the 2021 ACM SIGCOMM 2021 Conference. 731--747.
[51]
Ion Stoica, Scott Shenker, and Hui Zhang. 1998. Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks. SIGCOMM Comput. Commun. Rev. 28, 4 (oct 1998), 118--130.
[52]
Ao Tang, Jiantao Wang, Sanjay Hegde, and Steven H Low. 2005. Equilibrium and fairness of networks shared by TCP Reno and Vegas/FAST. Telecommunication Systems 30, 4 (2005), 417--439.
[53]
Ao Tang, Jiantao Wang, Steven H Low, and Mung Chiang. 2007. Equilibrium of heterogeneous congestion control: Existence and uniqueness. IEEE/ACM Transactions on Networking 15, 4 (2007), 824--837.
[54]
Belma Turkovic, Fernando A Kuipers, and Steve Uhlig. 2019. Fifty shades of congestion control: A performance and interactions evaluation. arXiv preprint arXiv:1903.03852 (2019).
[55]
Shie-Yuan Wang, Hsien-Wen Hu, and Yi-Bing Lin. 2020. Design and implementation of tcp-friendly meters in p4 switches. IEEE/ACM Transactions on Networking 28, 4 (2020), 1885--1898.
[56]
Ranysha Ware, Matthew K. Mukerjee, Srinivasan Seshan, and Justine Sherry. 2019. Beyond Jain's Fairness Index: Setting the Bar For The Deployment of Congestion Control Algorithms. In Proceedings of the 18th ACM Workshop on Hot Topics in Networks (HotNets '19). Association for Computing Machinery, New York, NY, USA, 17--24.
[57]
Ranysha Ware, Matthew K Mukerjee, Srinivasan Seshan, and Justine Sherry. 2019. Modeling BBR's interactions with loss-based congestion control. In Proceedings of the internet measurement conference. 137--143.
[58]
Jörg Widmer, Robert Denda, and Martin Mauve. 2001. A survey on TCP-friendly congestion control. IEEE network 15, 3 (2001), 28--37.
[59]
Lisong Xu, Khaled Harfoush, and Injong Rhee. 2004. Binary increase congestion control (BIC) for fast long-distance networks. In IEEE INFOCOM 2004, Vol. 4. IEEE, 2514--2524.
[60]
Liangcheng Yu, John Sonchack, and Vincent Liu. 2020. Mantis: Reactive programmable switches. In Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication. 296--309.
[61]
Liangcheng Yu, John Sonchack, and Vincent Liu. 2022. OrbWeaver: Using IDLE Cycles in Programmable Networks for Opportunistic Coordination. In 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22). USENIX Association, Renton, WA, 1195--1212. https://www.usenix.org/conference/nsdi22/presentation/yu

Cited By

View all
  • (2024)Dragonfly: In-Flight CCA IdentificationIEEE Transactions on Network and Service Management10.1109/TNSM.2024.338041721:3(2675-2685)Online publication date: Jun-2024
  • (2024)Adaptive Approximate Fair Queueing for Shared-Memory Programmable SwitchesIEEE Transactions on Network Science and Engineering10.1109/TNSE.2024.337781411:4(3563-3576)Online publication date: Jul-2024
  • (2024)Enhancing Fairness for Approximate Weighted Fair Queueing With a Single QueueIEEE/ACM Transactions on Networking10.1109/TNET.2024.339921232:5(3901-3915)Online publication date: Oct-2024
  • Show More Cited By

Recommendations

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
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 August 2022

Permissions

Request permissions for this article.

Check for updates

Badges

Author Tags

  1. P4
  2. congestion control
  3. max-min fairness
  4. programmable networks

Qualifiers

  • Research-article

Funding Sources

  • NSF

Conference

SIGCOMM '22
Sponsor:
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

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)461
  • Downloads (Last 6 weeks)44
Reflects downloads up to 15 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Dragonfly: In-Flight CCA IdentificationIEEE Transactions on Network and Service Management10.1109/TNSM.2024.338041721:3(2675-2685)Online publication date: Jun-2024
  • (2024)Adaptive Approximate Fair Queueing for Shared-Memory Programmable SwitchesIEEE Transactions on Network Science and Engineering10.1109/TNSE.2024.337781411:4(3563-3576)Online publication date: Jul-2024
  • (2024)Enhancing Fairness for Approximate Weighted Fair Queueing With a Single QueueIEEE/ACM Transactions on Networking10.1109/TNET.2024.339921232:5(3901-3915)Online publication date: Oct-2024
  • (2024)Taming the Aggressiveness of Heterogeneous TCP Traffic in Data Center NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2023.334704832:3(2253-2268)Online publication date: Jun-2024
  • (2023)Dragonfly: In-Flight CCA Identification2023 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking57963.2023.10186432(1-9)Online publication date: 12-Jun-2023
  • (2023)Scalable Real-Time Bandwidth Fairness in SwitchesIEEE/ACM Transactions on Networking10.1109/TNET.2023.331717232:2(1423-1434)Online publication date: 9-Oct-2023
  • (2023)Scalable Real-Time Bandwidth Fairness in SwitchesIEEE INFOCOM 2023 - IEEE Conference on Computer Communications10.1109/INFOCOM53939.2023.10228997(1-10)Online publication date: 17-May-2023
  • (2023)One-shot models for local core network placement and traffic optimization in self deployable networksJournal of Network and Computer Applications10.1016/j.jnca.2023.103721219:COnline publication date: 1-Oct-2023
  • (2022)PrintQueueProceedings of the ACM SIGCOMM 2022 Conference10.1145/3544216.3544257(516-529)Online publication date: 22-Aug-2022

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media