A.I.M.D., Fairness and Fractal Scaling of TCP Traffic - Inria - Institut national de recherche en sciences et technologies du numérique
Reports (Research Report) Year : 2001

A.I.M.D., Fairness and Fractal Scaling of TCP Traffic

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.
Fichier principal
Vignette du fichier
RR-4155.pdf (1.49 Mo) Télécharger le fichier

Dates and versions

inria-00072468 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072468 , version 1

Cite

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

Share

More