TCP is competitive against a limited adversary

While the well-known Transport Control Protocol (TCP) is a de facto standard for reliable communication on the Internet, and performs well in practice, the question "how good is the TCP/IP congestion control algorithm?" is not completely resolved. In this paper, we provide some answers to this question using the competitive analysis framework. First, we prove that for networks with a single bottleneck (or point of congestion), TCP is competitive to the optimal global algorithm in minimizing the user-perceived latency or flow time of the sessions. Specifically, we show that with O(1) times as much bandwidth and O(1) extra time per job, TCP is O(1)-competitive against an optimal global algorithm. We motivate the need for allowing TCP to have extra resources by observing that existing lower bounds for non-clairvoyant scheduling algorithms imply that no online, distributed, non-clairvoyant algorithm can be competitive with an optimal offline algorithm if both algorithms were given the same resources. Second, we show that TCP is fair by proving that it converges quickly to allocations where every session gets its fair share of network bandwidth.

[1]  Archan Misra,et al.  The window distribution of idealized TCP congestion avoidance with variable packet loss , 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).

[2]  Sally A. Goldman,et al.  TCP dynamic acknowledgment delay (extended abstract): theory and practice , 1998, STOC '98.

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

[4]  T. V. Lakshman,et al.  The performance of TCP/IP for networks with high bandwidth-delay products and random loss , 1997, TNET.

[5]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[6]  Sanjeev Arora,et al.  A Randomized Online Algorithm for Bandwidth Utilization , 2002, SODA '02.

[7]  R. Wilder,et al.  Wide-area Internet traffic patterns and characteristics , 1997, IEEE Netw..

[8]  Sally Floyd,et al.  Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic , 1991, CCRV.

[9]  Jeff Edmonds,et al.  Scheduling in the dark , 1999, STOC '99.

[10]  Rajeev Motwani,et al.  Non-clairvoyant scheduling , 1994, SODA '93.

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

[12]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[13]  Laurent Massoulié,et al.  Stability of distributed congestion control with heterogeneous feedback delays , 2002, IEEE Trans. Autom. Control..

[14]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract) , 1997, Symposium on the Theory of Computing.

[15]  J. Edmonds,et al.  On the Competitiveness of TCP within a General NetworkJe , 2001 .

[16]  Kirk Pruhs,et al.  Broadcast scheduling: when fairness is fine , 2002, SODA '02.

[17]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[18]  Sally A. Goldman,et al.  TCP Dynamic Acknowledgment Delay: Theory and Practice , 1998, STOC 1998.

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

[20]  Matthew Mathis,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.

[21]  Keith W. Ross,et al.  Computer networking - a top-down approach featuring the internet , 2000 .

[22]  Ramesh Johari,et al.  End-to-end congestion control for the internet: delays and stability , 2001, TNET.

[23]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[24]  Richard M. Karp,et al.  Optimization problems in congestion control , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[25]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[26]  Steven McCanne,et al.  On improving the fairness of TCP congestion avoidance , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[27]  Matthew Mathis,et al.  The stationary behavior of ideal TCP congestion avoidance , 1996 .

[28]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[29]  Sally A. Goldman,et al.  On-line analysis of the TCP acknowledgment delay problem , 2001, JACM.

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

[31]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.

[32]  B. Engquist,et al.  Mathematics Unlimited: 2001 and Beyond , 2001 .

[33]  Frank Kelly,et al.  Mathematical Modelling of the Internet , 2001 .