Pratiksha Thaker
Matei Zaharia
ABSTRACT
We posit that unfairness between congestion control algorithms in a network often results from actors optimizing, or attempting to optimize, incompatible utility functions. In order to mitigate this, we propose that algorithm designers should explicitly declare a utility function they hope to optimize, which enables theoretical analysis of the safety of the utility function with respect to other utilities in the network. When we can place utilities in a common game-theoretic framework, we can analytically determine the potential for an application with one of those utilities to be unsafe before it is deployed in a network, rather than determining safety properties ad-hoc from measurements after deployment. We give examples of the types of restrictions and guarantees that can arise from such a model in the context of rate-based congestion control protocols.
- 2020. Google Meet hardware requirements. https://support.google.com/meethardware/answer/4541234?hl=en#zippy=%2Cminimum-bandwidth-required. (2020).Google Scholar
- 2020. How much bandwidth does Skype need? https://support.skype.com/en/faq/FA1417/how-much-bandwidth-does-skype-need. (2020).Google Scholar
- Aditya Akella, Srinivasan Seshan, Richard Karp, Scott Shenker, and Christos Papadimitriou. 2002. Selfish behavior and stability of the Internet: A game-theoretic analysis of TCP. ACM SIGCOMM Computer Communication Review 32, 4 (2002), 117--130.Google ScholarDigital Library
- 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). USENIX Association.Google ScholarDigital Library
- 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.Google ScholarDigital Library
- Neal Cardwell, Yuchung Cheng, C Stephen Gunn, Soheil Hassas Yeganeh, and Van Jacobson. 2017. BBR: congestion-based congestion control. Commun. ACM 60, 2 (2017), 58--66.Google ScholarDigital Library
- Mung Chiang, SH Low, D Wei, and Ao Tang. 2006. Heterogeneous congestion control: Efficiency, fairness and design. In Proceedings of the 2006 IEEE International Conference on Network Protocols. IEEE, 127--136.Google ScholarDigital Library
- 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.Google Scholar
- Luis C Corchón. 1994. Comparative statics for aggregative games: the strong concavity case. Mathematical Social Sciences 28, 3 (1994), 151--165.Google ScholarCross Ref
- Mo Dong, Qingxi Li, Doron Zarchy, Philip Brighten Godfrey, and Michael Schapira. 2015. PCC: Re-architecting Congestion Control for Consistent High Performance.. In NSDI, Vol. 1. 2.Google Scholar
- Mo Dong, Tong Meng, Doron Zarchy, Engin Arslan, Yossi Gilad, Brighten Godfrey, and Michael Schapira. 2018. PCC Vivace: Online-learning congestion control. In 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18). 343--356.Google Scholar
- Eyal Even-Dar, Yishay Mansour, and Uri Nadav. 2009. On the convergence of regret minimization dynamics in concave games. In Proceedings of the forty-first annual ACM symposium on Theory of computing. 523--532.Google ScholarDigital Library
- Sally Floyd and Kevin Fall. 1999. Promoting the use of end-to-end congestion control in the Internet. IEEE/ACM Transactions on networking 7, 4 (1999), 458--472.Google ScholarDigital Library
- S. Ha, I. Rhee, and L. Xu. 2008. CUBIC: a new TCP-friendly high-speed TCP variant. ACM SIGOPS Operating Systems Review 42, 5 (2008), 64--74.Google ScholarDigital Library
- ITU. 2003. ITU-T Recommendation G.114: One-way transmission time. Technical Report.Google Scholar
- 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 (1984).Google Scholar
- Ramesh Johari and John N Tsitsiklis. 2004. Efficiency loss in a network resource allocation game. Mathematics of Operations Research 29, 3 (2004), 407--435.Google ScholarDigital Library
- F. P. Kelly, A. Maulloo, and D. Tan. 1998. Rate control for communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society (1998), 237--252.Google Scholar
- Kenji Kurata, Go Hasegawa, and Masayuki Murata. 2000. Fairness Comparisons Between TCP Reno and TCP Vegas for Future Deployment of TCP Vegas. https://web.archive.org/web/20160103040648/http://www.isoc.org/inet2000/cdproceedings/2d/2d_2.htm. In Internet Society Conference.Google Scholar
- Tong Meng, Neta Rozen Schiff, P Brighten Godfrey, and Michael Schapira. 2020. PCC Proteus: Scavenger Transport And Beyond. 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. 615--631.Google ScholarDigital Library
- Jeonghoon Mo, Richard J La, Venkat Anantharam, and Jean Walrand. 1999. Analysis and comparison of TCP Reno and Vegas. In IEEE INFOCOM, Vol. 3. INSTITUTE OF ELECTRICAL ENGINEERS INC (IEEE), 1556--1563.Google ScholarCross Ref
- Jitendra Padhye, Jim Kurose, Don Towsley, and Rajeev Koodli. 1999. A model based TCP-friendly rate control protocol. In Proceedings of NOSSDAVâĂŹ99. Citeseer.Google Scholar
- Rayadurgam Srikant. 2004. The mathematics of Internet congestion control. Springer Science & Business Media.Google ScholarDigital Library
- 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.Google ScholarDigital Library
- 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. 17--24.Google ScholarDigital Library
- 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.Google ScholarDigital Library
- Jörg Widmer, Robert Denda, and Martin Mauve. 2001. A survey on TCP-friendly congestion control. IEEE network 15, 3 (2001), 28--37.Google ScholarDigital Library
- Keith Winstein and Hari Balakrishnan. 2013. TCP ex machina: computer-generated congestion control. In ACM SIGCOMM Computer Communication Review, Vol. 43. ACM, 123--134.Google ScholarDigital Library
- Doron Zarchy, Radhika Mittal, Michael Schapira, and Scott Shenker. 2017. An axiomatic approach to congestion control. In Proceedings of the 16th ACM Workshop on Hot Topics in Networks. 115--121.Google ScholarDigital Library
- Doron Zarchy, Radhika Mittal, Michael Schapira, and Scott Shenker. 2019. Axiomatizing congestion control. Proceedings of the ACM on Measurement and Analysis of Computing Systems 3, 2 (2019), 1--33.Google ScholarDigital Library
Index Terms
- Don't Hate the Player, Hate the Game: Safety and Utility in Multi-Agent Congestion Control
Recommendations
Delay-based early congestion detection and adaptation in TCP: impact on web performance
Concerns over the scalability of TCP's end-to-end approach to congestion control and its AIMD congestion adaptation have led to proposals for router-based congestion control, specifically, active queue management (AQM). In this paper we present an end-...
Unreliable transport protocol using congestion control for high-speed networks
Currently there is no control for the real-time traffic of multimedia applications using UDP (User Datagram Protocol) in high-speed networks. Therefore, although a number of high-speed TCP (Transmission Control Protocol) protocols have been developed ...
An efficient and fair explicit congestion control protocol for high bandwidth-delay product networks
XCP and VCP can achieve excellent performance under high bandwidth-delay product networks, but they all have some defects. In XCP, router needs to calculate a feedback for each departing packet, the cost will be un-negligible in high-speed networks. In ...
Comments