AIMD algorithms and exponential functionals - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2002

AIMD algorithms and exponential functionals


The behavior of connection transmitting packets into a network according to a general additive-increase multiplicative-decrease (AIMD) algorithm is investigated. It is assumed that loss of packets occurs in clumps. When a packet is lost, a certain number of subsequent packets are also lost (correlated losses). The stationary behavior of this algorithm is analyzed when the rate of occurrence of clumps becomes arbitrarily small. From a probabilistic point of view, it is shown that exponential functionals associated to compound Poisson processes play a key role. A formula for the fractional moments and some density functions are derived. Analytically, to get the explicit expression of the distributions involved, the natural framework of this study turns out to be the q-calculus. Different loss models are then compared using concave ordering. Quite surprisingly, it is shown that, for a fixed loss rate, the correlated loss model has a higher throughput than an uncorrelated loss model.
Fichier principal
Vignette du fichier
RR-4447.pdf (290.03 Ko) Télécharger le fichier

Dates and versions

inria-00072141 , version 1 (23-05-2006)


  • HAL Id : inria-00072141 , version 1


Fabrice Guillemin, Philippe Robert, Albertus Zwart. AIMD algorithms and exponential functionals. [Research Report] RR-4447, INRIA. 2002. ⟨inria-00072141⟩
53 View
414 Download


Gmail Facebook X LinkedIn More