ABSTRACT
In a TCP/IP network, a key to ensure efficient and fair sharing of network resources among its users is the TCP congestion control (CC) scheme. Previously, the design of TCP CC schemes is based on hard-wiring of predefined actions to specific feedback signals from the network. However, as networks become more complex and dynamic, it becomes harder to design the optimal feedback-action mapping. Recently, learning-based TCP CC schemes have attracted much attention due to their strong capabilities to learn the actions from interacting with the network. In this paper, we design two learning-based TCP CC schemes for wired networks with under-buffered bottleneck links, a loss predictor (LP) based TCP CC (LP-TCP), and a reinforcement learning (RL) based TCP CC (RL-TCP). We implement both LP-TCP and RL-TCP in NS2. Compared to the existing NewReno and Q-learning based TCP, LP-TCP and RL-TCP both achieve a better tradeoff between throughput and delay, under various simulated network scenarios.
- Guido Appenzeller. 2005. Sizing router buffers. Ph.D. Dissertation. Stanford University, Palo Alto, CA. Google ScholarDigital Library
- Saad Biaz and Nitin H Vaidya. 1998. Distinguishing congestion losses from wireless transmission losses: A negative result. In Proc. 7th International Conference on Computer Communications and Networks. IEEE, Lafayette, LA, 722--731. Google ScholarDigital Library
- 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 13, 8 (1995), 1465--1480. Google ScholarDigital Library
- Mo Dong, Qingxi Li, and Doron Zarchy. 2015. PCC: Re-architecting Congestion Control for Consistent High Performance. In Proc. 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI'15). ACM, Oakland, CA, 395--408. Google ScholarDigital Library
- Sally Floyd and Tom Henderson. 1999. The NewReno modification to TCP's fast recovery algorithm. RFC 2582 (1999).Google Scholar
- Sangtae Ha, Injong Rhee, and Lisong Xu. 2008. CUBIC: a new TCP-friendly high-speed TCP variant. ACM SIGOPS Operating Systems Review 42, 5 (2008), 64--74. Google ScholarDigital Library
- Tin Kam Ho. 1995. Random decision forests. In Proc. the 3rd international conference on Document analysis and recognition. IEEE, Montreal, Que., Canada, 278--282. Google ScholarDigital Library
- Tin Kam Ho. 1998. The random subspace method for constructing decision forests. IEEE transactions on pattern analysis and machine intelligence 20, 8 (1998), 832--844. Google ScholarDigital Library
- Van Jacobson. 1988. Congestion avoidance and control. In Proc. ACM SIGCOMM. ACM, Stanford, CA, 314--329. Google ScholarDigital Library
- Van Jacobson. 1990. Modified TCP congestion avoidance algorithm. note sent to end2end-interest mailing list (1990).Google Scholar
- Raj Jain. 1989. A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks. ACM SIGCOMM Computer Communication Review 19, 5 (1989), 56--71. Google ScholarDigital Library
- Raj Jain, Dah-Ming Chiu, and William R Hawe. 1984. A quantitative measure of fairness and discrimination for resource allocation in shared computer system. Vol. 38. Eastern Research Laboratory, Digital Equipment Corporation Hudson, MA.Google Scholar
- A Jayaraj, T Venkatesh, and C Siva Ram Murthy. 2008. Loss classification in optical burst switching networks using machine learning techniques: Improving the performance of TCP. IEEE Journal on Selected Areas in Communications 26, 6 (2008). Google ScholarDigital Library
- Junchen Jiang, Shijie Sun, Vyas Sekar, and Hui Zhang. 2017. Pytheas: Enabling Data-Driven Quality of Experience Optimization Using Group-Based Exploration-Exploitation. In Proc. 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI'17). ACM, BOSTON, MA, 393--406. Google ScholarDigital Library
- Dina Katabi, Mark Handley, and Charlie Rohrs. 2002. Congestion control for high bandwidth-delay product networks. ACM SIGCOMM computer communication review 32, 4 (2002), 89--102. Google ScholarDigital Library
- Wei Li, Fan Zhou, Waleed Meleis, and Kaushik Chowdhury. 2016. Learning-based and Data-driven TCP Design for Memory-constrained IoT. In Proc. International Conference on Distributed Computing in Sensor Systems (DCOSS). IEEE, Washington, DC, 199--205.Google ScholarCross Ref
- Dapeng Liu, Youjian Zhao, Kaixin Sui, Lei Zou, Dan Pei, Qingqian Tao, Xiyang Chen, and Dai Tan. 2016. FOCUS: Shedding light on the high search response time in the wild. In Proc. The 35th Annual IEEE International Conference on Computer Communications (INFOCOM). IEEE, San Francisco, CA, 1--9.Google ScholarCross Ref
- Dapeng Liu, Youjian Zhao, Haowen Xu, Yongqian Sun, Dan Pei, Jiao Luo, Xiaowei Jing, and Mei Feng. 2015. Opprentice: Towards practical and automatic anomaly detection through machine learning. In Proc. the Internet Measurement Conference. ACM, Tokyo, Japan, 211--224. Google ScholarDigital Library
- Hongzi Mao, Mohammad Alizadeh, Ishai Menache, and Srikanth Kandula. 2016. Resource management with deep reinforcement learning. In Proc. the 15th ACM Workshop on Hot Topics in Networks. ACM, Atlanta, GA, 50--56. Google ScholarDigital Library
- Hongzi Mao, Ravi Netravali, and Mohammad Alizadeh. 2017. Neural adaptive video streaming with Pensieve. In Proc. ACM SIGCOMM. ACM, Los Angeles, CA, 197--210. Google ScholarDigital Library
- Mariyam Mirza, Joel Sommers, Paul Barford, and Xiaojin Zhu. 2010. A machine learning approach to TCP throughput prediction. IEEE/ACM Transactions on Networking 18, 4 (2010), 1026--1039. Google ScholarDigital Library
- Bruno Astuto Arouche Nunes, Kerry Veenstra, William Ballenthin, Stephanie Lukin, and Katia Obraczka. 2014. A machine learning framework for TCP round-trip time estimation. EURASIP Journal on Wireless Communications and Networking 1 (2014), 47.Google ScholarCross Ref
- Lopamudra Roychoudhuri and Ehab S Al-Shaer. 2005. Real-time packet loss prediction based on end-to-end delay variation. IEEE transactions on Network and Service Management 2, 1 (2005), 29--38. Google ScholarDigital Library
- Anirudh Sivaraman, Keith Winstein, Pratiksha Thaker, and Hari Balakrishnan. 2014. An experimental study of the learnability of congestion control. In Proc. ACM SIGCOMM. ACM, Chicago, IL, 479--490. Google ScholarDigital Library
- Yi Sun, Xiaoqi Yin, Junchen Jiang, Vyas Sekar, Fuyuan Lin, Nanshu Wang, Tao Liu, and Bruno Sinopoli. 2016. CS2P: Improving video bitrate selection and adaptation with data-driven throughput prediction. In Proc. ACM SIGCOMM. ACM, Florianópolis, Brazil, 272--285. Google ScholarDigital Library
- Richard S Sutton and Andrew G Barto. 1998. Reinforcement learning: An introduction. Vol. 1. Cambridge: MIT press. Google ScholarDigital Library
- C-H Tai, Jiang Zhu, and Nandita Dukkipati. 2008. Making large scale deployment of RCP practical for real networks. In Proc. The 27th Conference on Computer Communications. IEEE, Phoenix, AZ, 2180--2188.Google ScholarCross Ref
- Kun Tan, Jingmin Song, Qian Zhang, and Murad Sridharan. 2006. A compound TCP approach for high-speed and long distance networks. In Proc. IEEE INFOCOM. IEEE, Barcelona, Spain, 1--12.Google ScholarCross Ref
- Zheng Wang and Jon Crowcroft. 1991. A new congestion control scheme: Slow start and search (Tri-S). ACM SIGCOMM Computer Communication Review 21, 1 (1991), 32--43. Google ScholarDigital Library
- Christopher John Cornish Hellaby Watkins. 1989. Learning from delayed rewards. Ph.D. Dissertation. King's College, Cambridge, Cambridge, UK.Google Scholar
- Keith Winstein and Hari Balakrishnan. 2013. TCP ex machina: Computer-generated congestion control. In Proc. ACM SIGCOMM. ACM, Hong Kong, China, 123--134. Google ScholarDigital Library
- Yasir Zaki, Thomas Pötsch, Jay Chen, Lakshminarayanan Subramanian, and Carmelita Görg. 2015. Adaptive congestion control for unpredictable cellular networks. In Proc. ACM SIGCOMM. ACM, London, United Kingdom, 509--522. Google ScholarDigital Library
Index Terms
- Improving TCP Congestion Control with Machine Intelligence
Recommendations
Performance evaluation of Westwood+ TCP congestion control
Internet performance symposium (IPS 2002)Westwood+ TCP is a sender-side only modification of the classic Tahoe/Reno TCP that has been recently proposed to improve fairness and efficiency of TCP. The key idea of Westwood+ TCP is to perform an end-to-end estimate of the bandwidth available for a ...
Delay-based congestion avoidance for TCP
The set of TCP congestion control algorithms associated with TCP/Reno (e.g., slow-start and congestion avoidance) have been crucial to ensuring the stability of the Internet. Algorithms such as TCP/NewReno (which has been deployed) and TCP/Vegas (which ...
TCP congestion control method of improving friendliness over satellite internet
ICICS'09: Proceedings of the 7th international conference on Information, communications and signal processingThe number of wireless Internet service users that use wireless LAN or satellite links has increased. The broadband satellite Internet services have especially attracted attention because of its characteristics such as global coverage and robustness. ...
Comments