IEEE/ACM Transactions on Networking (TON)
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Fixed point approximations for TCP behavior in an AQM network
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Window flow control in FIFO networks with cross traffic
Queueing Systems: Theory and Applications
A closed form formula for long-lived TCP connections throughput
Performance Evaluation
Resource pricing and the evolution of congestion control
Automatica (Journal of IFAC)
Using partial differential equations to model TCP mice and elephants in large IP networks
IEEE/ACM Transactions on Networking (TON)
Loss-resilient window-based congestion control
Computer Networks: The International Journal of Computer and Telecommunications Networking
A scalable approach for steady state traffic modeling in high-speed backbone networks
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
IEEE/ACM Transactions on Networking (TON)
On the interaction between TCP-like sources and throughput-efficient scheduling policies
Performance Evaluation
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
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 in the small buffer case, 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 nonperiodic 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.