Flow level simulation of large IP networks

The aim of this paper is to simulate the interaction of a large number of TCP controlled flows and UDP flows sharing many routers/links, from the knowledge of the network parameters (capacity, buffer size, topology, scheduling) and of the characteristics of each TCP (RTT, route etc.) and UDP flow. This work is based on the description via some fluid evolution equations, of the joint evolution of the window sizes of all flows over a single bottleneck router/link, as function of the synchronization rate. It is shown that the generalization of this fluid dynamics to a network composed of several routers can be described via equations allowing one to simulate the interaction of e.g. millions of TCP flows on networks composed of tens of thousands of links and routers on a standard workstation. The main output of the simulator are the mean value and the fluctuations of the throughput obtained by each flow, the localization of the bottleneck routers/links, the losses on each of them and the time evolution of aggregated input traffic at each router or link. The method is validated against NS simulations. We show that several important statistical properties of TCP traffic which were identified on traces are also present on traffic generated by our simulator: for instance, aggregated traffic generated by this representation exhibits the same short time scale statistical properties as those observed on real traces. Similarly, the experimental laws describing the fairness of the bandwidth sharing operated by TCP over a large network are also observed on the simulations.

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

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

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

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

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

[6]  Walter Willinger,et al.  Self-similarity and heavy tails: structural modeling of network traffic , 1998 .

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

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

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

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

[11]  Thomas Bonald,et al.  Comparison of TCP Reno and TCP Vegas via Fluid Approximation , 1999 .

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

[13]  Dohy Hong.  A Note on the TCP Fluid Model , 2003 .

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

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

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

[17]  João P. Hespanha,et al.  A Hybrid Systems Framework for TCP Congestion Control : A Theoretical Model and its Simulation-based Validation , 2001 .

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