On the competitiveness of AIMD-TCP within a general network

This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when it is driven by bottleneck capacities. Extending the paper by Edmonds, Datta, and Dymond that solves the single bottleneck case, we view AIMD as a distributed scheduling algorithm and prove that with extra resources, it is competitive against the optimal global algorithm in minimizing the average flow time of the jobs.

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

[2]  Paul G. Spirakis,et al.  Max-min Fair Flow Control Sensitive to Priorities , 2005, J. Interconnect. Networks.

[3]  Paul G. Spirakis,et al.  The global efficiency of distributed, rate-based, flow control algorithms , 1998, PODC '98.

[4]  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).

[5]  Jeff Edmonds.  Scheduling in the dark , 2000, Theor. Comput. Sci..

[6]  Frank Kelly,et al.  Fairness and Stability of End-to-End Congestion Control , 2003, Eur. J. Control.

[7]  François Baccelli,et al.  AIMD, fairness and fractal scaling of TCP traffic , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[9]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..

[10]  Raj Jain,et al.  The osu scheme for congestion avoidance using explicit rate indication , 1994 .

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

[12]  E. L. Hahne,et al.  Round robin scheduling for fair flow control in data communication networks , 1986, ICC.

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

[14]  K. K. Ramakrishnan,et al.  An efficient rate allocation algorithm for ATM networks providing max-min fairness , 1995, HPN.

[15]  Jeannine Mosely,et al.  Asynchronous distributed flow control algorithms , 1984 .

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

[17]  A. Charny,et al.  An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback , 1994 .

[18]  Jeff Edmonds,et al.  TCP is competitive against a limited adversary , 2003, SPAA '03.

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

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

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

[22]  Raj Jain,et al.  Congestion control with explicit rate indication , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[23]  E. L. Hahne,et al.  Round-Robin Scheduling for Max-Min Fairness in Data Networks , 1991, IEEE J. Sel. Areas Commun..

[24]  K. K. Ramakrishnan,et al.  Time scale analysis scalability issues for explicit rate allocation in ATM networks , 1996, TNET.

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

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

[27]  Jeffrey M. Jaffe,et al.  Flow Control Power is Nondecentralizable , 1981, IEEE Trans. Commun..

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

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

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

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