Stein's Method for Mean Field Approximations in Light and Heavy Traffic Regimes

Author:

Ying Lei1

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)

Subject

General Medicine

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篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Server Saturation in Skewed Networks;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2024-05-21

2. SOLT: A Software-Defined Load Balancing Algorithm for Time Sensitive Networks;GLOBECOM 2023 - 2023 IEEE Global Communications Conference;2023-12-04

3. Mean-field fluctuations at diffusion scale in threshold-based randomized routing for processor sharing systems and applications;Stochastic Models;2023-09-04

4. Age-Dependent Distributed MAC for Ultra-Dense Wireless Networks;IEEE/ACM Transactions on Networking;2023-08

5. Refined mean‐field approximation for discrete‐time queueing networks with blocking;Naval Research Logistics (NRL);2023-06-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3