Interaction of TCP flows as billiards

The aim of this paper is to analyze the performance of a large number of long lived TCP controlled flows sharing many routers (or links), from the knowledge of the network parameters (capacity, buffer size, topology) and of the characteristics of each TCP flow (RTT, route etc.) when taking synchronization into account. It is shown that the dynamics of such a network can be described in terms of iterate of random piecewise affine maps, or geometrically as a billiards in the Euclidean space with as many dimensions as the number of flow classes and as many reflection facets as there are routers. This class of billiards exhibits both periodic and non-periodic asymptotic oscillations, the characteristics of which are extremely sensitive to the parameters of the network. It is also shown that for large populations and in the presence of synchronization, aggregated throughputs exhibit fluctuations that are due to the network as a whole, that follow some complex fractal patterns, and that come on top of other and more classical flow or packet level fluctuations. The consequences on TCP's fairness are exemplified on a few typical cases of small dimension.

[1]  Andras Veres,et al.  The chaotic nature of TCP congestion control , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Thomas Bonald,et al.  Window flow control in FIFO networks with cross traffic , 1999, Queueing Syst. Theory Appl..

[3]  Walter Willinger,et al.  Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level , 1997, TNET.

[4]  Anja Feldmann,et al.  Dynamics of IP traffic: a study of the role of variability and the impact of control , 1999, SIGCOMM '99.

[5]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

[6]  J. Boudec,et al.  The Fairness of Additive Increase and Multiplicative Decrease , 1998 .

[7]  Dohy Hong,et al.  Many TCP User Asymptotic Analysis of the AIMD Model , 2001 .

[8]  François Baccelli,et al.  Flow level simulation of large IP networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[10]  François Baccelli,et al.  Interaction of TCP flows as billiards , 2005, IEEE/ACM Transactions on Networking.

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

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

[13]  C. Graham,et al.  Chaos hypothesis for a system interacting through shared resources , 1994 .

[14]  Laurent Massoulié,et al.  Bandwidth sharing and admission control for elastic traffic , 2000, Telecommun. Syst..

[15]  Fernando Paganini,et al.  Dynamics of TCP/RED and a scalable control , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[16]  Makoto Mori.  Zeta Function and Perron-Frobenius Operator of Piecewise Linear Transformations on $\mathbf{R}^k$ , 1995 .

[17]  Laurent Massoulié,et al.  Impact of fairness on Internet performance , 2001, SIGMETRICS '01.

[18]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[19]  Barry Simon,et al.  Topics in Ergodic Theory , 1994 .

[20]  Patrice Abry,et al.  Wavelets for the Analysis, Estimation, and Synthesis of Scaling Data , 2002 .

[21]  Donald F. Towsley,et al.  Fixed point approximations for TCP behavior in an AQM network , 2001, SIGMETRICS '01.

[22]  Augustin Chaintreau,et al.  A closed form formula for long-lived TCP connections throughput , 2002, Perform. Evaluation.

[23]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

[24]  François Baccelli,et al.  Elements Of Queueing Theory , 1994 .

[25]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 2002, TNET.

[26]  Jean-Yves Le Boudec,et al.  Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[27]  Rudolf H. Riedi,et al.  Multifractal Properties of TCP Traffic: a Numerical Study , 1997 .

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

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