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.I.M.D., Fairness and Fractal Scaling of TCP Traffic

François Baccelli 1 Dohy Hong 1
1 TREC - Theory of networks and communications
DI-ENS - Département d'informatique - ENS Paris, Inria Paris-Rocquencourt
Abstract : We propose a natural and simple model for the joint throughput evolution of a set of TCP sessions sharing a common bottleneck router, via products of random matrices. Surprisingly enough, even when based on the assumption of i.i.d losses, this model is sufficient to explain the fractal scaling of aggregates of TCP traffic at short time scales, which was recently identified by a statistical analysis based on wavelets by Feldmann, Gilbert, Willinger et al. in [8,7]. This model has various other implications, also described in the paper, such as the quantification of instantaneous fairness, the characterization of the autocorrelation function of inter-loss periods, or the evaluation of the performance degradation due to synchronizati- on of losses in the shared bottleneck router.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 10:02:32 AM
Last modification on : Thursday, March 17, 2022 - 10:08:32 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:09:08 PM


  • HAL Id : inria-00072468, version 1



François Baccelli, Dohy Hong. A.I.M.D., Fairness and Fractal Scaling of TCP Traffic. [Research Report] RR-4155, INRIA. 2001. ⟨inria-00072468⟩



Record views


Files downloads