{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T03:30:26Z","timestamp":1768447826359,"version":"3.49.0"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T00:00:00Z","timestamp":1560902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2019,6,19]]},"abstract":"<jats:p>The overwhelmingly large design space of congestion control protocols, along with the increasingly diverse range of application environments, makes evaluating such protocols a daunting task. Simulation and experiments are very helpful in evaluating the performance of designs in specific contexts, but give limited insight into the more general properties of these schemes and provide no information about the inherent limits of congestion control designs (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 to specific, predetermined objectives (e.g., network utility maximization), or the analysis of specific protocols (e.g., from control-theoretic perspectives), as opposed to the inherent tensions\/derivations between desired properties. To complement today's prevalent experimental and theoretical approaches, we put forth a novel principled framework for reasoning about congestion control protocols, which is inspired by the axiomatic approach from social choice theory and game theory. We consider several natural requirements (\"axioms'') from congestion control protocols -- e.g., efficient resource-utilization, loss-avoidance, fairness, stability, and TCP-friendliness -- and investigate which combinations of these can be achieved within a single design. Thus, our framework allows us to investigate the fundamental tradeoffs between desiderata, and to identify where existing and new congestion control architectures fit within the space of possible outcomes.<\/jats:p>","DOI":"10.1145\/3341617.3326148","type":"journal-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:18:56Z","timestamp":1561033136000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Axiomatizing Congestion Control"],"prefix":"10.1145","volume":"3","author":[{"given":"Doron","family":"Zarchy","sequence":"first","affiliation":[{"name":"Hebrew University of Jerusalem, Jerusalem, Israel"}]},{"given":"Radhika","family":"Mittal","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana-Champaign , IL, USA"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem, Jerusalem, Israel"}]},{"given":"Scott","family":"Shenker","sequence":"additional","affiliation":[{"name":"University of California, Berkley, Berkley, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,6,19]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993744.1993751"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622655.1622669"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1734213.1734220"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-005-5498-2"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2008.12.023"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367525"},{"key":"e_1_2_1_7_1","volume-title":"A difficulty in the concept of social welfare. Journal of political economy","author":"Arrow K. J.","year":"1950","unstructured":"K. J. Arrow. A difficulty in the concept of social welfare. Journal of political economy, 1950."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3232755.3232783"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916251"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC2309"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.464716"},{"key":"e_1_2_1_12_1","first-page":"3122","volume-title":"Decision and Control and European Control Conference (CDC-ECC), 2011 50th IEEE Conference on","year":"2011","unstructured":"Briat, Hjalmarsson, Johansson, Jonsson, Karlsson, Sandberg, and Yavuz. An axiomatic fluid-flow model for congestion control analysis. In Decision and Control and European Control Conference (CDC-ECC), 2011 50th IEEE Conference on, pages 3122--3129. IEEE, 2011."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2005.843360"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3012426.3022184"},{"key":"e_1_2_1_15_1","volume-title":"An axiomatic approach to sustainable development. Social choice and welfare","author":"Chichilnisky G.","year":"1996","unstructured":"G. Chichilnisky. An axiomatic approach to sustainable development. Social choice and welfare, 1996."},{"key":"e_1_2_1_16_1","volume-title":"Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN systems","author":"Chiu D.-M.","year":"1989","unstructured":"D.-M. Chiu and R. Jain. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN systems, 1989."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2887007.2887016"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2789770.2789798"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/3307441.3307471"},{"key":"e_1_2_1_20_1","volume-title":"Metrics for the Evaluation of Congestion Control Mechanisms. RFC","author":"Floyd S.","year":"2008","unstructured":"S. Floyd. Metrics for the Evaluation of Congestion Control Mechanisms. RFC 5166, Mar. 2008."},{"key":"e_1_2_1_21_1","volume-title":"A comparison of equation-based and AIMD congestion control","author":"Floyd S.","year":"2000","unstructured":"S. Floyd, M. Handley, and J. Padhye. A comparison of equation-based and AIMD congestion control. 2000."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914083"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1811099.1811051"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400097.1400105"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916670"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-009-9143-8"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.611099"},{"key":"e_1_2_1_28_1","volume-title":"INFOCOM 2015","author":"Lev O.","year":"2015","unstructured":"O. Lev, M. Tennenholtz, and A. Zohar. An axiomatic approach to routing. In INFOCOM 2015, 2015."},{"key":"e_1_2_1_29_1","article-title":"On fluid queueing systems with strict priority","author":"Liu Y.","year":"2003","unstructured":"Y. Liu and W. Gong. On fluid queueing systems with strict priority. IEEE Transactions on Automatic Control, 2003.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/263932.264023"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787510"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.752178"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.879343"},{"key":"e_1_2_1_34_1","volume-title":"2015 USENIX Annual Technical Conference (USENIX ATC 15)","author":"Netravali R.","year":"2015","unstructured":"R. Netravali, A. Sivaraman, S. Das, A. Goyal, K. Winstein, J. Mickens, and H. Balakrishnan. Mahimahi: Accurate record-and-replay for HTTP. In 2015 USENIX Annual Technical Conference (USENIX ATC 15), 2015."},{"key":"e_1_2_1_35_1","volume-title":"The stationary behavior of ideal TCP congestion avoidance","author":"Ott T.","year":"1996","unstructured":"T. Ott, J. Kemperman, and M. Mathis. The stationary behavior of ideal TCP congestion avoidance. 1996."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/285237.285291"},{"key":"e_1_2_1_37_1","volume-title":"A control theoretical look at internet congestion control. Lecture notes in control and information sciences","author":"Paganini F.","year":"2003","unstructured":"F. Paganini, J. Doyle, and S. H. Low. A control theoretical look at internet congestion control. Lecture notes in control and information sciences, 2003."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.829643"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1070873.1070885"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.752152"},{"key":"e_1_2_1_41_1","volume-title":"Strategy-proofness and arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of economic theory","author":"Satterthwaite M. A.","year":"1975","unstructured":"M. A. Satterthwaite. Strategy-proofness and arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of economic theory, 1975."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/99508.99547"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.876178"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/230719.230732"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535771.2535796"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/984116"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/1036843.1036909"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060313"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486020"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/2482626.2482670"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1137\/040620953"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/850937.852516"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/115992.116006"}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341617.3326148","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341617.3326148","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:29Z","timestamp":1750200089000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341617.3326148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,19]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6,19]]}},"alternative-id":["10.1145\/3341617.3326148"],"URL":"https:\/\/doi.org\/10.1145\/3341617.3326148","relation":{},"ISSN":["2476-1249"],"issn-type":[{"value":"2476-1249","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,19]]},"assertion":[{"value":"2019-06-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}