Network Friendly Congestion Control: Framework, Protocol Design and Evaluation

The increase in bandwidth, the number of internet users and the variety of internet applications, all point towards the need for adaptive and flexible internet protocols. Alternatively, they also emphasize on the necessity for specialized protocols that cater to application requirements. Current Transport protocols such as TCP and UDP are not flexible enough to be used by applications which differ in their performance expectations. UDP, for example, is inelastic in nature and therefore can cause exacerbation of congestion in an already congested network. TCP on the other hand was designed to provide proportional fairness, such that a ``flow'' is the unit which is allocated resources. This not only results in all flows having an equal share at the bandwidth irrespective of the application requirements, but also give way to a new trend of applications that are able to take advantage of the ``flow-oriented'' fairness. Delay-insensitive applications, such as P2P file sharing, generate substantial amounts of traffic and compete with other applications on an equal footing while using TCP. Further, to optimize throughput, such applications open multiple connections. This results in an unfair and potentially poor service for applications having stringent performance objectives. The main part of this thesis proposes NF-TCP, a TCP variant for P2P and similar background delay-insensitive applications. NF-TCP aims to be submissive to delay-sensitive applications under congestion. It is designed to be network friendly based on a fluid flow model for intermediate queues and uses explicit congestion notification (ECN) for early detection of congestion. Moreover, it exploits the measure of the available bandwidth to be able to aggressively utilize spare capacity. It can be observed that the traditional congestion control protocols comprise of tightly coupled mechanisms, and are designed to address a specific problem or scenario. They either lack the flexibility in meeting varying requirements or utilizing different types of available network support. This thesis proposes a congestion control framework that consists of pluggable components and utilizes it to guide the NF-TCP design. It identifies congestion-detection, flow-control and bandwidth-estimation as the main components of the congestion control protocol, which can be loosely or strictly decoupled from each other under a modular framework. This thesis implemented NF-TCP on Linux and ns-2. The evaluations of the NF-TCP Linux implementation on ns-2 show that NF-TCP outperforms other network friendly approaches (e.g., LEDBAT, TCP-LP and RAPID). NF-TCP achieves high utilization, fair bandwidth allocation among NF-TCP flows and maintains a small average queue. The evaluations further demonstrate that with NF-TCP, the available bandwidth can be efficiently utilized for supporting both delay-sensitive and insensitive traffic in a wide range of scenarios.

[1]  Aleksandar Kuzmanovic,et al.  TCP-LP: a distributed algorithm for low priority data transfer , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Bob Briscoe,et al.  Flow rate fairness: dismantling a religion , 2007, CCRV.

[3]  Jasleen Kaur,et al.  RAPID: Shrinking the Congestion-Control Timescale , 2009, IEEE INFOCOM 2009.

[4]  Qian Zhang,et al.  A Compound TCP Approach for High-Speed and Long Distance Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[5]  T. V. Lakshman,et al.  SRED: stabilized RED , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[6]  Srinivasan Seshan,et al.  The Congestion Manager , 2001, RFC.

[7]  Ren Wang,et al.  TCP westwood with agile probing: dealing with dynamic, large, leaky pipes , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[8]  Philip Eardley,et al.  Metering and Marking Behaviour of PCN-Nodes , 2009, RFC.

[9]  Dario Rossi,et al.  News from the Internet congestion control world , 2009, ArXiv.

[10]  Arun Venkataramani,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tcp Nice: a Mechanism for Background Transfers , 2022 .

[11]  Donald F. Towsley,et al.  A control theoretic analysis of RED , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[12]  Janardhan R. Iyengar,et al.  Low Extra Delay Background Transport (LEDBAT) , 2012, RFC.

[13]  Vern Paxson,et al.  TCP Congestion Control , 1999, RFC.

[14]  Wu-chang Fengy,et al.  BLUE: A New Class of Active Queue Management Algorithms , 1999 .

[15]  Sally Floyd,et al.  HighSpeed TCP for Large Congestion Windows , 2003, RFC.

[16]  Murat Yuksel,et al.  Class-of-service in ip backbones: informing the network neutrality debate , 2008, SIGMETRICS '08.

[17]  Bob Briscoe PCN 3-State Encoding Extension in a single DSCP , 2009 .

[18]  Larry L. Peterson,et al.  TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[19]  Mark Handley,et al.  Congestion control for high bandwidth-delay product networks , 2002, SIGCOMM.

[20]  Injong Rhee,et al.  CUBIC: a new TCP-friendly high-speed TCP variant , 2008, OPSR.

[21]  Lakshminarayanan Subramanian,et al.  One more bit is enough , 2005, SIGCOMM '05.

[22]  Larry Peterson,et al.  TCP Vegas: new techniques for congestion detection and avoidance , 1994, SIGCOMM 1994.

[23]  W. Richard Stevens,et al.  TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms , 1997, RFC.

[24]  Michael Menth,et al.  The Need for Congestion Exposure in the Internet , 2009 .

[25]  Taieb Znati,et al.  On the Design of Load Factor based Congestion Control Protocols for Next-Generation Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[26]  Xiaoming Fu,et al.  An Encoding Method to Signal 3 States with a Single PCN Bit , 2009, IEEE INFOCOM Workshops 2009.

[27]  K. K. Ramakrishnan,et al.  NF-TCP: A Network Friendly TCP Variant for Background Delay-Insensitive Applications , 2011, Networking.

[28]  R. Srikant,et al.  A time scale decomposition approach to adaptive ECN marking , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[29]  Steven H. Low,et al.  REM: active queue management , 2001, IEEE Netw..

[30]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[31]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[32]  Sally Floyd,et al.  Quick-Start for TCP and IP , 2007, RFC.