A class of mean field interaction models for computer and communication systems

• Published in: Performance evaluation Vol. 65; no. 11; pp. 823 - 838
• Main Authors: Benaïm, Michel, Le Boudec, Jean-Yves
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.11.2008
• Subjects: Bianchi’s formula; Decoupling assumption; Dynamical system; Fixed point; Game theory; MAC protocol; Markov chain; Mean field interaction model; Reputation systems; Markov chain; Reputation systems; Bianchi’s formula; Decoupling assumption; MAC protocol; Dynamical system; Game theory; Mean field interaction model; Fixed point
• ISSN: 0166-5316; 1872-745X
• DOI: 10.1016/j.peva.2008.03.005

We consider models of N interacting objects, where the interaction is via a common resource and the distribution of states of all objects. We introduce the key scaling concept of intensity; informally, the expected number of transitions per object per time slot is of the order of the intensity. We consider the case of vanishing intensity, i.e. the expected number of object transitions per time slot is o ( N ) . We show that, under mild assumptions and for large N , the occupancy measure converges, in mean square (and thus in probability) over any finite horizon, to a deterministic dynamical system. The mild assumption is essentially that the coefficient of variation of the number of object transitions per time slot remains bounded with N . No independence assumption is needed anywhere. The convergence results allow us to derive properties valid in the stationary regime. We discuss when one can assure that a stationary point of the ODE is the large N limit of the stationary probability distribution of the state of one object for the system with N objects. We use this to develop a critique of the fixed point method sometimes used in conjunction with the decoupling assumption.