Random Multi-access Algorithms - A Mean Field analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2005

Random Multi-access Algorithms - A Mean Field analysis

Charles Bordenave
David Mcdonald
  • Function : Author
Alexandre Proutière
  • Function : Author
  • PersonId : 833456


In this paper, using mean field techniques, we present a performance analysis of random back-off algorithms, such as the exponential back-off algorithm, in the case of a finite number of saturated sources. We prove that when the number of sources grows large, the system is decoupled, i.e., source behaviors become mutually independent. These results are applied in the specific case of exponential back-off algorithms, where the transient and stationary distributions of the back-off processes are explicitly characterized. This work provides a theoretical justification of decoupling arguments used by many authors, e.g. Bianchi [4], to analyze the performance of random algorithms in Wireless LANs.
Fichier principal
Vignette du fichier
RR-5632.pdf (132.31 Ko) Télécharger le fichier

Dates and versions

inria-00070375 , version 1 (19-05-2006)


  • HAL Id : inria-00070375 , version 1


Charles Bordenave, David Mcdonald, Alexandre Proutière. Random Multi-access Algorithms - A Mean Field analysis. [Research Report] RR-5632, INRIA. 2005, pp.12. ⟨inria-00070375⟩
180 View
438 Download


Gmail Facebook Twitter LinkedIn More