Affiliation:
1. Arizona State University, Tempe, AZ, USA
Abstract
Mean-field analysis is an analytical method for understanding large-scale stochastic systems such as large-scale data centers and communication networks. The idea is to approximate the stationary distribution of a large-scale stochastic system using the equilibrium point (called the mean-field limit) of a dynamical system (called the mean-field model). This approximation is often justified by proving the weak convergence of stationary distributions to its mean-field limit. Most existing mean-field models concerned the light-traffic regime where the load of the system, denote by ρ, is strictly less than one and is independent of the size of the system. This is because a traditional mean-field model represents the limit of the corresponding stochastic system. Therefore, the load of the mean-field model is ρ= lim
N
→ ∞
ρ
(
N
)
, where ρ
(
N
)
is the load of the stochastic system of size
N.
Now if ρ
(
N
)→ 1
as
N
→ ∞ (i.e., in the heavy-traffic regime), then ρ=1. For most systems, the mean-field limits when ρ=1 are trivial and meaningless. To overcome this difficulty of traditional mean-field models, this paper takes a different point of view on mean-field models. Instead of regarding a mean-field model as the limiting system of large-scale stochastic system, it views the equilibrium point of the mean-field model, called a mean-field solution, simply as an approximation of the stationary distribution of the finite-size system. Therefore both mean-field models and solutions can be functions of
N.
This paper first outlines an analytical method to bound the approximation error based on Stein's method and the perturbation theory. We further present two examples: the
M/M/N
queueing system and the supermarket model under the power-of-two-choices algorithm. For both applications, the method enables us to characterize the system performance under a broad range of traffic loads. For the supermarket model, this is the first paper that rigorously quantifies the steady-state performance of the-power-of-two-choices in the heavy-traffic regime. These results in the heavy-traffic regime cannot be obtained using the traditional mean-field analysis and the interchange of the limits.
Funder
Office of Naval Research
National Science Foundation
Publisher
Association for Computing Machinery (ACM)
Reference31 articles.
1. A Diffusion Regime with Nondegenerate Slowdown
2. A particle system in interaction with a rapidly varying environment: Mean field limits and applications
3. Continuous approximation of collective system behaviour: A tutorial
4. A. Braverman and J. G. Dai. High order steady-state diffusion approximation of the Erlang-C system. arXiv preprint arXiv:1602.02866 2016. A. Braverman and J. G. Dai. High order steady-state diffusion approximation of the Erlang-C system. arXiv preprint arXiv:1602.02866 2016.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献