Efficiency of TCP-friendly window adjustment strategies in wired/wireless networks

TCP(a,b) protocols parameterize the congestion window increase value and decrease ratio , motivated by the QoS requirements of multimedia applications for smooth rate adjustments. Based on a projection of the expected throughput of standard TCP(1,.5), modified versions of the protocol have been designed to generate smoother traffic patterns and to maintain a friendly behavior. In this paper, we study the design assumptions of TCP(a,b) and we discuss the impact of equation-based modulation of a and b on application efficiency. We confirm experimentally that, in general, smoothness and responsiveness constitute a tradeoff; however, we uncover undesirable dynamics of the protocols when the network is heterogeneous (wired/wireless) or the flow characteristics do not follow a prescribed and static behavior. For example, we show that smooth backward adjustments confine the protocol's capability to exploit resources that become available rapidly after a handoff in mobile network, and embarrass the fair and efficient growth of incoming flows. Furthermore, we show that in the context of wireless networks with high error rate, a low a dictates a conservative behavior that degrades the protocol performance with both best-effort and real-time applications; and in the context of high contention of heterogeneous flows, a low a does not contribute to efficiency and friendliness.

[1]  Min Sik Kim,et al.  Transient behaviors of TCP-friendly congestion control protocols , 2003, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Deepak Bansal,et al.  Dynamic behavior of slowly-responsive congestion control algorithms , 2001, SIGCOMM 2001.

[3]  Jörg Widmer,et al.  TCP Friendly Rate Control (TFRC): Protocol Specification , 2003, RFC.

[4]  Mark Handley,et al.  Equation-based congestion control for unicast applications , 2000, SIGCOMM.

[5]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[6]  Yang Richard Yang,et al.  General AIMD congestion control , 2000, Proceedings 2000 International Conference on Network Protocols.

[7]  Henning Schulzrinne,et al.  The Loss-delay Based Adjustment Algorithm: a Tcp-friendly Adaptation Scheme , 1998 .

[8]  Min Sik Kim,et al.  Transient behaviors of TCP-friendly congestion control protocols , 2003, Comput. Networks.

[9]  Ibrahim Matta,et al.  Open issues on TCP for mobile computing , 2001, Wirel. Commun. Mob. Comput..

[10]  Mark Handley,et al.  A Comparison of Equation-Based and AIMD Congestion Control , 2000 .

[11]  Sally Floyd,et al.  Congestion Control Principles , 2000, RFC.

[12]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[13]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.