A particle system in interaction with a rapidly varying environment: Mean field limits and applications

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.

[1]  Thomas G. Kurtz,et al.  Averaging for martingale problems and stochastic approximation , 1992 .

[2]  F. Baccelli,et al.  Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences , 2010 .

[3]  Martin Shubik,et al.  A strategic market game with secured lending , 1997 .

[4]  M. Manhart,et al.  Markov Processes , 2018, Introduction to Stochastic Processes and Simulation.

[5]  Lorenzo Pareschi,et al.  On a Kinetic Model for a Simple Market Economy , 2004, math/0412429.

[6]  F. Baccelli,et al.  The Radial Spanning Tree of a Poisson Point Process , 2007, math/0703024.

[7]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[8]  Frank Kelly,et al.  Stochastic Models of Computer Communication Systems , 1985 .

[9]  Mark A. McComb Comparison Methods for Stochastic Models and Risks , 2003, Technometrics.

[10]  A. Girotra,et al.  Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function , 2005 .

[11]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[12]  A. Bensoussan,et al.  Asymptotic analysis for periodic structures , 1979 .

[13]  R. Bass,et al.  Review: P. Billingsley, Convergence of probability measures , 1971 .

[14]  C. Graham Chaoticity on path space for a queueing network with selection of the shortest queue among several , 2000, Journal of Applied Probability.

[15]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.

[16]  C. Graham,et al.  Stochastic particle approximations for generalized Boltzmann models and convergence estimates , 1997 .

[17]  Soung Chang Liew,et al.  Improving Throughput and Fairness by Reducing Exposed and Hidden Nodes in 802.11 Networks , 2008, IEEE Transactions on Mobile Computing.

[18]  D. Dawson Critical dynamics and fluctuations for a mean-field model of cooperative behavior , 1983 .

[19]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[20]  Patrick Thiran,et al.  A Packing Approach to Compare Slotted and Non-Slotted Medium Access Control , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[21]  C. D. Meyer,et al.  Comparison of perturbation bounds for the stationary distribution of a Markov chain , 2001 .

[22]  J. A. Fill Eigenvalue bounds on convergence to stationarity for nonreversible markov chains , 1991 .

[23]  Charles Bordenave,et al.  Random Multi-access Algorithms - A Mean Field analysis , 2005 .

[24]  Peter Donnelly,et al.  Particle Representations for Measure-Valued Population Models , 1999 .

[25]  Pierre Del Moral Propagation of Chaos , 2004 .

[26]  Alexandre Proutière,et al.  Asymptotic Stability Region of Slotted Aloha , 2008, IEEE Transactions on Information Theory.

[27]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[28]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[29]  Hiroshi Tanaka,et al.  Central limit theorem for a system of Markovian particles with mean field interactions , 1985 .