A class of mean field interaction models for computer and communication systems
Performance Evaluation
How to model and analyze gossiping protocols?
ACM SIGMETRICS Performance Evaluation Review
MeanField analysis for the evaluation of gossip protocols
ACM SIGMETRICS Performance Evaluation Review
Analysis of Large Populations of Interacting Objects with Mean Field and Markovian Agents
EPEW '09 Proceedings of the 6th European Performance Engineering Workshop on Computer Performance Engineering
Mean field asymptotics of Markov decision evolutionary games and teams
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
A mean field approach for optimization in particle systems and applications
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Analysis of Television and Cinema Productions using Mean Field Models
Electronic Notes in Theoretical Computer Science (ENTCS)
A fluid analysis framework for a Markovian process algebra
Theoretical Computer Science
Mean-field framework for performance evaluation of push-pull gossip protocols
Performance Evaluation
Photonic Network Communications
A mean field approach for optimization in discrete time
Discrete Event Dynamic Systems
Higher moment analysis of a spatial stochastic process algebra
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Comparison of the mean-field approach and simulation in a peer-to-peer botnet case study
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Availability in large networks: global characteristics from local unreliability properties
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Continuous approximation of collective system behaviour: A tutorial
Performance Evaluation
On incentivizing upload capacity in P2P-VoD systems: Design, analysis and evaluation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Bounds on the deviation of discrete-time Markov chains from their mean-field model
Performance Evaluation
| Hi-index | 0.02 |
We consider a model for interacting objects, where the evolution of each object is given by a finite state Markov chain, whose transition matrix depends on the present and the past of the distribution of states of all objects. This is a general model of wide applicability; we mention as examples: TCP connections, HTTP flows, robot swarms, reputation systems. We show that when the number of objects is large, the occupancy measure of the system converges to a deterministic dynamical system (the "mean field") with dimension the number of states of an individual object. We also prove a fast simulation result, which allows to simulate the evolution of a few particular objects imbedded in a large system. We illustrate how this can be used to model the determination of reputation in large populations, with various liar strategies.