Random Multi-access Algorithms - A Mean Field analysis
Résumé
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.
Loading...