[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Axiomatizing Congestion Control

Published: 17 December 2019 Publication History

Abstract

Recent years have witnessed a revival of both industrial and academic interest in improving congestion control designs. The quest for better congestion control is complicated by the extreme diversity and range of (i) the design space (as exemplified by the stark conceptual and operational differences between recent proposals [2, 4, 6]), (ii) the desired properties (ranging from high performance to fairness to TCP-friendliness), (iii) the envisioned operational setting (inter- and intra-datacenter, wireless, the commercial Internet, satellite), and (iv) the application loads and requirements (small vs. large traffic demands, latency- vs. bandwidth-sensitive).
Most congestion control research uses simulation and experiments under a limited range of network conditions. This is extremely important for understanding the detailed performance of particular schemes in specific settings, but provides limited insight into the more general properties of these schemes and no information about the inherent limits (such as, which properties are simultaneously achievable and which are mutually exclusive). In contrast, traditional theoretical approaches are typically focused on the design of protocols that achieve specific, predetermined objectives (e.g., network utility maximization [7]), or the analysis of specific protocols (e.g., from control-theoretic perspectives [12]), as opposed to exploring the inherent tensions/derivations between desired properties.
We advocate an axiomatic approach to congestion control, which is complementary to the experimental and theoretical work currently being pursued. Our approach, modeled on similar efforts in social choice theory and game theory [1], identifies a set of requirements ("axioms") and then identifies (i) which of its subsets of requirements can coexist (i.e., there are designs that achieve all of them) and which subsets cannot be met simultaneously (i.e., no design can simultaneously achieve all of them), and (ii) whether some requirements immediately follow from satisfying other requirements. Thus, the axiomatic approach can shed light on the inherent tradeoffs involved in congestion control protocol design, and can be leveraged to classify existing and proposed solutions according to the properties they satisfy.

References

[1]
Kenneth J Arrow. 1950. A difficulty in the concept of social welfare. Journal of political economy (1950).
[2]
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). Renton, WA, 329--342.
[3]
Lawrence S. Brakmo and Larry L. Peterson. 1995. TCP Vegas: End to end congestion avoidance on a global Internet. IEEE Journal on selected Areas in communications (1995).
[4]
Neal Cardwell, Yuchung Cheng, C Stephen Gunn, Soheil Hassas Yeganeh, and Van Jacobson. 2016. BBR: Congestion-Based Congestion Control. Queue (2016).
[5]
Sara Cohen and Aviv Zohar. 2015. An Axiomatic Approach to Link Prediction. In AAAI. Citeseer.
[6]
Mo Dong, TongMeng, Doron Zarchy, Engin Arslan, Yossi Gilad, Brighten Godfrey, and Michael Schapira. 2018. Vivace: Online-Learning Congestion Control. In 15th USENIX Symposium on NSDI 18. USENIX Association.
[7]
F. P. Kelly, L. Massoulié, and N. S. Walton. 2009. Resource pooling in congested networks: proportional fairness and product form. Queueing Systems 63, 1 (2009), 165.
[8]
TV Lakshman and Upamanyu Madhow. 1997. The performance of TCP/IP for networks with high bandwidth-delay products and random loss. Transactions on Networking (ToN) (1997).
[9]
Omer Lev, Moshe Tennenholtz, and Aviv Zohar. 2015. An Axiomatic Approach to Routing. In INFOCOM 2015.
[10]
Jeonghoon Mo, Richard J La, Venkat Anantharam, and Jean Walrand. 1999. Analysis and comparison of TCP Reno and Vegas. In INFOCOM'99.
[11]
Jitendra Padhye, Victor Firoiu, Don Towsley, and Jim Kurose. 1998. Modeling TCP throughput: A simple model and its empirical validation. SIGCOMM (1998).
[12]
Fernando Paganini, John Doyle, and Steven H Low. 2003. A control theoretical look at Internet congestion control. Lecture notes in control and information sciences (2003).
[13]
Scott Shenker. 1990. A theoretical analysis of feedback flowcontrol. In SIGCOMM.
[14]
Anirudh Sivaraman, Keith Winstein, Suvinay Subramanian, and Hari Balakrishnan. 2013. No Silver Bullet: Extending SDN to the Data Plane. In Twelfth ACM Workshop on Hot Topics in Networks (HotNets-XII). College Park, MD.
[15]
Keith Winstein, Anirudh Sivaraman, Hari Balakrishnan, et al. 2013. Stochastic Forecasts Achieve High Throughput and Low Delay over Cellular Networks. In NSDI.

Index Terms

  1. Axiomatizing Congestion Control
              Index terms have been assigned to the content through auto-classification.

              Recommendations

              Comments

              Please enable JavaScript to view thecomments powered by Disqus.

              Information & Contributors

              Information

              Published In

              cover image ACM SIGMETRICS Performance Evaluation Review
              ACM SIGMETRICS Performance Evaluation Review  Volume 47, Issue 1
              June 2019
              100 pages
              ISSN:0163-5999
              DOI:10.1145/3376930
              Issue’s Table of Contents
              Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              Published: 17 December 2019
              Published in SIGMETRICS Volume 47, Issue 1

              Check for updates

              Qualifiers

              • Research-article

              Contributors

              Other Metrics

              Bibliometrics & Citations

              Bibliometrics

              Article Metrics

              • 0
                Total Citations
              • 50
                Total Downloads
              • Downloads (Last 12 months)2
              • Downloads (Last 6 weeks)0
              Reflects downloads up to 04 Jan 2025

              Other Metrics

              Citations

              View Options

              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