skip to main content
research-article
Open Access

On the Bottleneck Structure of Congestion-Controlled Networks

Published:17 December 2019Publication History
Skip Abstract Section

Abstract

In this paper, we introduce theTheory of Bottleneck Ordering, a mathematical framework that reveals the bottleneck structure of data networks. This theoretical framework provides insights into the inherent topological properties of a network in at least three areas: (1) It identifies the regions of influence of each bottleneck; (2) it reveals the order in which bottlenecks (and flows traversing them) converge to their steady state transmission rates in distributed congestion control algorithms; and (3) it provides key insights into the design of optimized traffic engineering policies. We demonstrate the efficacy of the proposed theory in TCP congestion-controlled networks for two broad classes of algorithms: Congestion-based algorithms (TCP BBR) and loss-based additive-increase/multiplicative-decrease algorithms (TCP Cubic and Reno). Among other results, our network experiments show that: (1) Qualitatively, both classes of congestion control algorithms behave as predicted by the bottleneck structure of the network; (2) flows compete for bandwidth only with other flows operating at the same bottleneck level; (3) BBR flows achieve higher performance and fairness than Cubic and Reno flows due to their ability to operate at the right bottleneck level; (4) the bottleneck structure of a network is continuously changing and its levels can be folded due to variations in the flows' round trip times; and (5) against conventional wisdom, low-hitter flows can have a large impact to the overall performance of a network.

References

  1. Dimitri P. Bertsekas and Robert G. Gallager. 1992. Data Networks. Vol. 2. Prentice-Hall Inc., Englewood Cliffs, New Jersey 07632.Google ScholarGoogle Scholar
  2. Neal Cardwell, Yuchung Cheng, C. Stephen Gunn, Soheil Hassas Yeganeh, and Van Jacobson. 2016. BBR: Congestion- Based Congestion Control. ACM Queue 14, 5, Article 50 (October 2016), 34 pages. https://doi.org/10.1145/3012426.3022184Google ScholarGoogle Scholar
  3. Dah-Ming W. 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 (June 1989), 1--14. https://doi.org/10.1016/0169--7552(89)90019--6Google ScholarGoogle Scholar
  4. Benoit Claise, Ganesh Sadasivan, Vamsi Valluri, and Martin Djernaes. 2004. NetFlow Specifications, Cisco Systems. (2004). Retrieved October 24, 2019 from https://www.ietf.org/rfc/rfc3954.txtGoogle ScholarGoogle Scholar
  5. COSMOS Lab. 2019. The Cosmos Testbed. (2019). Retrieved October 24, 2019 from https://cosmos-lab.orgGoogle ScholarGoogle Scholar
  6. ESnet. 2019. ESnet Energy Sciences Network. (2019). Retrieved October 24, 2019 from http://es.net/network-r-and-d/ experimental-network-testbeds/test-circuit-service/Google ScholarGoogle Scholar
  7. Kevin Fall and Sally Floyd. 1996. Simulation-based Comparisons of Tahoe, Reno and SACK TCP. SIGCOMM Computer Communication Review 26, 3 (July 1996), 5--21. https://doi.org/10.1145/235160.235162Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Tiago Fioreze, Lisandro Granville, Ramin Sadre, and Aiko Pras. 2009. A Statistical Analysis of Network Parameters for the Self-Management of Lambda-Connections. In Scalability of Networks and Services. Springer Berlin Heidelberg, Berlin, Heidelberg, 15--27. https://doi.org/10.1007/978--3--642-02627-0_2Google ScholarGoogle Scholar
  9. Hannes Gredler, Jan Medved, Stefano Previdi, Adrian Farrel, and Saikat Ray. 2016. BGP-LS Protocol Specification. (2016). Retrieved October 24, 2019 from https://tools.ietf.org/html/rfc7752Google ScholarGoogle Scholar
  10. Sangtae Ha, Injong Rhee, and Lisong Xu. 2008. CUBIC: A New TCP-friendly High-speed TCP Variant. SIGOPS operating systems review 42, 5 (July 2008), 64--74. https://doi.org/10.1145/1400097.1400105Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Iperf.fr. 2019. iPerf - The ultimate speed test tool for TCP, UDP and SCTP. (2019). Retrieved October 24, 2019 from https://iperf.fr/Google ScholarGoogle Scholar
  12. M. Schoffstall J. Davin J. Case, M. Fedor. 1990. A Simple Network Management Protocol (SNMP). (1990). Retrieved October 24, 2019 from https://tools.ietf.org/html/rfc1157Google ScholarGoogle Scholar
  13. Van Jacobson. 1988. Congestion Avoidance and Control. SIGCOMM computer communication review 18, 4 (August 1988), 314--329. https://doi.org/10.1145/52325.52356Google ScholarGoogle Scholar
  14. Raj Jain, Dah-Ming W. Chiu, and William R. Hawe. 1998. A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems. CoRR cs.NI/9809099 (1998), 38. http://arxiv.org/abs/cs.NI/9809099Google ScholarGoogle Scholar
  15. Sushant Jain, Alok Kumar, Subhasree Mandal, Joon Ong, Leon Poutievski, Arjun Singh, Subbaiah Venkata, Jim Wanderer, Junlan Zhou, Min Zhu, Jon Zolla, Urs Hölzle, Stephen Stuart, and Amin Vahdat. 2013. B4: Experience with a Globally-Deployed Software Defined WAN. SIGCOMM Computer Communication Review 43, 4 (August 2013), 3--14. https://doi.org/10.1145/2534169.2486019Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Lavanya Jose, Lisa Yan, Mohammad Alizadeh, George Varghese, Nick McKeown, and Sachin Katti. 2015. High Speed Networks Need Proactive Congestion Control. In Proceedings of the 14th ACM Workshop on Hot Topics in Networks (HotNets-XIV). ACM, New York, NY, USA, Article 14, 7 pages. https://doi.org/10.1145/2834050.2834096Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Frank P. Kelly, Aman K. Maulloo, and David K. H. Tan. 1998. Rate Control for Communication Networks: Shadow Prices, Proportional Fairness and Stability. Journal of the Operational Research society 49, 3 (01 March 1998), 237--252. https://doi.org/10.1057/palgrave.jors.2600523Google ScholarGoogle ScholarCross RefCross Ref
  18. Reservoir Labs. 2019. G2-Mininet Sandbox: Mininet extensions to support the analysis of the bottleneck structure of networks. (2019). Retrieved October 24, 2019 from https://github.com/reservoirlabs/g2-mininetGoogle ScholarGoogle Scholar
  19. Kun-Chan Lan and John Heidemann. 2006. A Measurement Study of Correlations of Internet Flow Characteristics. Computer Networks 50, 1 (2006), 46--62. https://doi.org/10.1016/j.comnet.2005.02.008Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Yi Lu, Mei Wang, Balaji Prabhakar, and Flavio Bonomi. 2007. ElephantTrap: A Low Cost Device for Identifying Large Flows. In 15th Annual IEEE Symposium on High-Performance Interconnects (HOTI 2007). IEEE, 99--108. https://doi.org/10.1109/HOTI.2007.13Google ScholarGoogle Scholar
  21. Mininet. 2019. Mininet: An Instant Virtual Network on your Laptop (or other PC). (2019). Retrieved October 24, 2019 from http://mininet.org/Google ScholarGoogle Scholar
  22. Peter Phaal, Sonia Panchen, and Neil McKee. 2001. sFlow Specifications, InMon Corporation. IETF RFC 3176 (2001).Google ScholarGoogle Scholar
  23. NOX Repo POX. 2019. The POX Network Software Platform. (2019). Retrieved October 24, 2019 from https://noxrepo.github.io/pox-doc/html/Google ScholarGoogle Scholar
  24. Konstantinos Psounis, Arpita Ghosh, Balaji Prabhakar, and Gang Wang. 2005. SIFT: A Simple Algorithm for Tracking Elephant Flows, and Taking Advantage of Power Laws. In 43rd Allerton Conference on Communication, Control and Computing.Google ScholarGoogle Scholar
  25. Jordi Ros-Giralt. 2003. A Theory of Lexicographic Optimization for Computer Networks. University of California, Irvine, Irvine, California. https://doi.org/10.13140/RG.2.1.2188.1368 AAI3101616.Google ScholarGoogle Scholar
  26. Jordi Ros-Giralt and Wei K. Tsai. 2001. A Theory of Convergence Order of Maxmin Rate Allocation and an Optimal Protocol. In Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), Vol. 2. IEEE, 717--726 vol.2. https://doi.org/10.1109/INFCOM.2001.916260Google ScholarGoogle Scholar
  27. Jordi Ros-Giralt and Wei K. Tsai. 2010. A Lexicographic Optimization Framework to the Flow Control Problem. IEEE Transactions on Information Theory 56, 6 (June 2010), 2875--2886. https://doi.org/10.1109/TIT.2010.2046227Google ScholarGoogle Scholar
  28. Jerome H. Saltzer, David P. Reed, and David D. Clark. 1984. End-to-end Arguments in System Design. ACM Transactions on Computer Systems (TOCS) 2, 4 (November 1984), 277--288. https://doi.org/10.1145/357401.357402Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Shriram Sarvotham, Rudolf Riedi, and Richard Baraniuk. 2001. Connection-level Analysis and Modeling of Network Traffic. In Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement (IMW '01). ACM, New York, NY, USA, 99--103. https://doi.org/10.1145/505202.505215Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. SCinet. 2019. The SCinet Network at Supercomputing. (2019). Retrieved October 24, 2019 from https://sc19. supercomputing.org/scinet/all-about-scinet/Google ScholarGoogle Scholar
  31. Suricata. 2019. Suricata: Open Source IDS / IPS / NSM engine. (2019). Retrieved October 24, 2019 from https://suricata-ids.org/Google ScholarGoogle Scholar
  32. Zeek. 2019. The Zeek Network Security Monitor. (2019). Retrieved October 24, 2019 from https://www.zeek.org/Google ScholarGoogle Scholar
  33. Yu Zhang, Binxing Fang, and Yongzheng Zhang. 2010. Identifying High-Rate Flows based on Bayesian Single Sampling. In 2010 2nd International Conference on Computer Engineering and Technology, Vol. 1. IEEE, V1--370--V1--374. https://doi.org/10.1109/ICCET.2010.5486097Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. On the Bottleneck Structure of Congestion-Controlled Networks

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!