HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

A Closed Form Formula for Long-lived TCP Connections Throughput

Augustin Chaintreau 1 Danny de Vleeschauwer
1 TREC - Theory of networks and communications
DI-ENS - Département d'informatique - ENS Paris, Inria Paris-Rocquencourt
Abstract : In this paper, we study the variation of the throughput achieved by TCP resulting from both the individual behavior of a connection and the interactio- n with all other connections sharing the same link. In particular, we calculate the Tail Distribution Function (TDF) of the instantaneous throughput seen by one TCP connection in the Additive Increase Multiplicative Decrease (AIMD) framework. For the particular case that each TCP connection experiences the same Round Trip Time (RTT) and under the many user approximati- on we prove that this TDF is given by a closed-form formula that solely depends on the network parameters (number of sources, capacity and buffer size of the bottleneck link). This formula can then be used as a dimensioning tool, where throughput is guaranteed to each user to be «larger than a given value for at least a certain percentage of the time». In the context defined here, this formula plays the same role for the dimensioning of an IP router as the Erlang B formula does for the dimensioning of a PSTN switch.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 7:54:04 PM
Last modification on : Thursday, March 17, 2022 - 10:08:32 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:55:19 PM


  • HAL Id : inria-00072145, version 1



Augustin Chaintreau, Danny de Vleeschauwer. A Closed Form Formula for Long-lived TCP Connections Throughput. [Research Report] RR-4443, INRIA. 2002. ⟨inria-00072145⟩



Record views


Files downloads