Buffer sizes for large multiplexers: TCP queueing theory and instability analysis

In large multiplexers with many TCP flows, the aggregate traffic flow behaves predictably; this is a basis for the fluid model of Misra, Gong and Towsley V. Misra et al., (2000) and for a growing literature on fluid models of congestion control. In this paper we argue that different fluid models arise from different buffer-sizing regimes. We consider the large buffer regime (buffer size is bandwidth-delay product), an intermediate regime (divide the large buffer size by the square root of the number of flows), and the small buffer regime (buffer size does not depend on number of flows). Our arguments use various techniques from queueing theory. We study the behaviour of these fluid models (on a single bottleneck Kink, for a collection of identical long-lived flows). For what parameter regimes is the fluid model stable, and when it is unstable what is the size of oscillations and the impact on goodput? Our analysis uses an extension of the Poincare-Linstedt method to delay-differential equations. We find that large buffers with drop-tail have much the same performance as intermediate buffers with either drop-tail or AQM; that large buffers with RED are better at least for window sizes less than 20 packets; and that small buffers with either drop-tail or AQM are best over a wide range of window sizes, though the buffer size must be chosen carefully. This suggests that buffer sizes should be much much smaller than is currently recommended.

[1]  H. C. Morris A Perturbative Approach to Periodic Solutions of Delay-differential Equations , 1976 .

[2]  V. Paxson,et al.  Wide-area traffic: the failure of Poisson modeling , 1994, SIGCOMM.

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

[4]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[5]  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.

[6]  Max L. Warshauer,et al.  Lecture Notes in Mathematics , 2001 .

[7]  Pirkko Kuusela,et al.  Modeling RED with Idealized TCP Sources , 2001 .

[8]  Jin Cao,et al.  A Poisson limit for buffer overflow probabilities , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[9]  Glenn Vinnicombe,et al.  ON THE STABILITY OF NETWORKS OPERATING TCP-LIKE CONGESTION CONTROL , 2002 .

[10]  François Baccelli,et al.  A mean-field model for multiple TCP connections through a buffer implementing RED , 2002, Perform. Evaluation.

[11]  T. P. Kelly,et al.  On engineering a stable and scalable TCP variant , 2002 .

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

[13]  Vishal Misra,et al.  TCP networks stabilized by buffer-based AQMs , 2004, IEEE INFOCOM 2004.

[14]  Marco Ajmone Marsan,et al.  Using partial differential equations to model TCP mice and elephants in large IP networks , 2004, IEEE INFOCOM 2004.

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

[16]  Damon Wischik,et al.  Big Queues, Springer Lecture Notes in Mathematics , 2004 .

[17]  Derong Liu The Mathematics of Internet Congestion Control , 2005, IEEE Transactions on Automatic Control.

[18]  D. McDonald,et al.  MEAN FIELD CONVERGENCE OF A MODEL OF MULTIPLE TCP CONNECTIONS THROUGH A BUFFER IMPLEMENTING RED , 2006, math/0603325.

[19]  R. Srikant,et al.  Rate-based versus queue-based models of congestion control , 2004, IEEE Transactions on Automatic Control.