A class of mean field interaction models for computer and communication systems
Reads0
Chats0
TLDR
It is shown 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.About:
This article is published in Performance Evaluation.The article was published on 2008-11-01 and is currently open access. It has received 299 citations till now. The article focuses on the topics: Stationary point & Expected value.read more
Citations
More filters
Journal ArticleDOI
Voluntary Energy Harvesting Relays and Selection in Cooperative Wireless Networks
TL;DR: This work considers a cooperative system in which EH nodes volunteer to serve as amplify-and-forward relays whenever they have sufficient energy for transmission, and quantifies how the energy usage at an EH relay and, consequently, its availability for relaying, depends not only on the relay's energy harvesting process, but also on its transmit power setting and the other relays in the system.
Journal ArticleDOI
Continuous approximation of collective system behaviour: A tutorial
TL;DR: An overview of the field of deterministic approximation of Markov processes, both in discrete and continuous times, is presented, considering the cases in which the deterministic limit process lives in continuous time or discrete time.
Journal ArticleDOI
Scalable Differential Analysis of Process Algebra Models
TL;DR: A deterministic approximation to the underlying Markov chain model based on ordinary differential equations is presented, presenting a deterministic solution to the problem of state-space explosion of large-scale software systems with discrete-state approaches.
Proceedings ArticleDOI
Mean field asymptotics of Markov Decision Evolutionary Games and teams
TL;DR: In this article, a Markov Decision Evolutionary Game with N players is introduced, in which each individual in a large population interacts with other randomly selected players, and the states and actions of each player in an interaction together determine the instantaneous payoff for all involved players.
Book ChapterDOI
Fluid model checking
Luca Bortolussi,Jane Hillston +1 more
TL;DR: A potential use of fluid approximation techniques in the context of stochastic model checking of CSL formulae to approximate the behaviour of a single agent with a time-inhomogeneous CTMC which depends on the environment and on the other agents only through the solution of the fluid differential equation.
References
More filters
Journal ArticleDOI
Performance analysis of the IEEE 802.11 distributed coordination function
TL;DR: In this paper, a simple but nevertheless extremely accurate, analytical model to compute the 802.11 DCF throughput, in the assumption of finite number of terminals and ideal channel conditions, is presented.
BookDOI
Adaptive Algorithms and Stochastic Approximations
TL;DR: The juxtaposition of these two expressions in the title reflects the ambition of the authors to produce a reference work, both for engineers who use adaptive algorithms and for probabilists or statisticians who would like to study stochastic approximations in terms of problems arising from real applications.
Book
Stochastic Approximation Algorithms and Applications
Harold J. Kushner,George Yin +1 more
TL;DR: Applications and issues application to learning, state dependent noise and queueing applications to signal processing and adaptive control mathematical background convergence with probability one, introduction weak convergence methods for general algorithms applications, proofs of convergence rate of convergence averaging of the iterates distributed/decentralized and asynchronous algorithms.
Journal ArticleDOI
IEEE 802.11-saturation throughput analysis
TL;DR: A simple analytical model is presented to compute the saturation throughput performance in the presence of a finite number of terminals and in the assumption of ideal channel conditions, which shows that the model is extremely accurate in predicting the system throughput.