Random multi-access algorithms in networks with partial interaction: A mean field analysis
2010 (English)In: Networks and Heterogeneous Media, ISSN 1556-1801, Vol. 5, no 1, 31-62 p.Article in journal (Refereed) Published
We study an interacting particle system whose dynamics depends on an interacting random environment. As the number of particles grows large, the transition rate of the particles slows down (perhaps because they share a common resource of fixed capacity). The transition rate of a particle is determined by its state, by the empirical distribution of all the particles and by a rapidly varying environment. The transitions of the environment are determined by the empirical distribution of the particles. We prove the propagation of chaos on the path space of the particles and establish that the limiting trajectory of the empirical measure of the states of the particles satisfies a deterministic differential equation. This deterministic differential equation involves the time averages of the environment process.
We apply the results on particle systems to understand the behavior of computer networks where users access a shared resource using a distributed random Medium Access Control (MAC) algorithm. MAC algorithms are used in all Local Area Network (LAN), and have been notoriously difficult to analyze. Our analysis allows us to provide simple and explicit expressions of the network performance under such algorithms.
Place, publisher, year, edition, pages
American Institute of Mathematical Sciences , 2010. Vol. 5, no 1, 31-62 p.
Mean field analysis, Particle system
Computer and Information Science
Research subject SRA - ICT
IdentifiersURN: urn:nbn:se:kth:diva-30586OAI: oai:DiVA.org:kth-30586DiVA: diva2:400858
QC 201103032011-02-282011-02-282011-03-03Bibliographically approved