Stability of Network Congestion Control with Asynchronous Updates

For network congestion control with many flows, current theoretical models predict worse performance than what the empirical study shows. In this paper, we introduce asynchronism among many flows to the traditional fluid-based model and develop an asynchronous model for network congestion control where each end-user sees slightly different snapshots of the network. Based on our model, we prove that the system is always stable when there are many flows with asynchronous updates. Both our theoretical and numerical results confirm that the asynchronism plays a dominant role in the stability of network congestion control and our asynchronous model reflects the reality far better than any other traditional fluid models with synchronous updates

[1]  R. Srikant,et al.  Stability and convergence of TCP-like congestion controllers in a many-flows regime , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Sally Floyd,et al.  Measuring the evolution of transport protocols in the internet , 2005, CCRV.

[3]  J. Strikwerda.  A probabilistic analysis of asynchronous iteration , 2002 .

[4]  D. Szyld.  The Mystery Of Asynchronous Iterations Convergence When The Spectral Radius Is One , 1998 .

[5]  Amogh Dhamdhere,et al.  Open issues in router buffer sizing , 2006, CCRV.

[6]  T. Basar,et al.  Global stability analysis of an end-to-end congestion control scheme for general topology networks with delay , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[7]  E. Kaszkurewicz,et al.  FURTHER RESULTS ON CONVERGENCE OF ASYNCHRONOUS LINEAR ITERATIONS , 1998 .

[8]  B A Huberman,et al.  Evolutionary games and computer simulations. , 1993, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[10]  Fernando Paganini,et al.  Linear stability of TCP/RED and a scalable control , 2003, Comput. Networks.

[11]  Frank Kelly,et al.  Models for a self–managed Internet , 2000, Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[12]  Victor S. Kozyakin.  Asynchronous systems: a short survey and problems∗ , 2003 .

[13]  Vishal Misra,et al.  Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED , 2000, SIGCOMM 2000.

[14]  Eddie Kohler,et al.  Internet research needs better models , 2003, CCRV.

[15]  Y. Saad,et al.  Iterative solution of linear systems in the 20th century , 2000 .

[16]  Vishal Misra,et al.  Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED , 2000, SIGCOMM.

[17]  Yin Zhang,et al.  Understanding the performance of many TCP flows , 2001, Comput. Networks.

[18]  R. Srikant,et al.  How good are deterministic fluid models of Internet congestion control? , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[19]  G. Raina,et al.  Buffer sizes for large multiplexers: TCP queueing theory and instability analysis , 2005, Next Generation Internet Networks, 2005.

[20]  B. Schönfisch,et al.  Synchronous and asynchronous updating in cellular automata. , 1999, Bio Systems.

[21]  Guido Appenzeller,et al.  Sizing router buffers , 2004, SIGCOMM '04.