Scalable load balancing in networked systems: A survey of recent advances
In this survey we provide an overview of recent advances on scalable load balancing
schemes which provide favorable delay performance and yet require minimal …
schemes which provide favorable delay performance and yet require minimal …
Mean field graph based d2d collaboration and offloading pricing in mobile edge computing
X Wang, J Ye, JCS Lui - IEEE/ACM Transactions on …, 2023 - ieeexplore.ieee.org
Mobile edge computing (MEC) facilitates computation offloading to edge server and task
processing via device-to-device (D2D) collaboration. Existing works mainly focus on …
processing via device-to-device (D2D) collaboration. Existing works mainly focus on …
A survey on large-population systems and scalable multi-agent reinforcement learning
The analysis and control of large-population systems is of great interest to diverse areas of
research and engineering, ranging from epidemiology over robotic swarms to economics …
research and engineering, ranging from epidemiology over robotic swarms to economics …
Mean field and refined mean field approximations for heterogeneous systems: It works!
S Allmeier, N Gast - Proceedings of the ACM on Measurement and …, 2022 - dl.acm.org
Mean field approximation is a powerful technique to study the performance of large
stochastic systems represented as n interacting objects. Applications include load balancing …
stochastic systems represented as n interacting objects. Applications include load balancing …
Steady-state analysis of the join-the-shortest-queue model in the Halfin–Whitt regime
A Braverman - Mathematics of Operations Research, 2020 - pubsonline.informs.org
This paper studies the steady-state properties of the join-the-shortest-queue model in the
Halfin–Whitt regime. We focus on the process tracking the number of idle servers and the …
Halfin–Whitt regime. We focus on the process tracking the number of idle servers and the …
Improving the mean-field fluid model of processor sharing queueing networks for dynamic performance models in cloud computing
Resource management in cloud computing is a difficult problem, as one needs to balance
between adequate service to clients and cost minimization in a dynamic environment of …
between adequate service to clients and cost minimization in a dynamic environment of …
[图书][B] Many agent games in socio-economic systems: corruption, inspection, coalition building, network growth, security
VN Kolokoltsov, OA Malafeyev - 2019 - Springer
The general picture of game-theoretic modeling dealt with in this book is characterized by a
set of big players, also referred to as principals or major agents, acting in the background of …
set of big players, also referred to as principals or major agents, acting in the background of …
Steady-state analysis of load-balancing algorithms in the sub-Halfin–Whitt regime
We study a class of load-balancing algorithms for many-server systems (N servers). Each
server has a buffer of size (ra positive integer). The proof of the main result is based on the …
server has a buffer of size (ra positive integer). The proof of the main result is based on the …
Size expansions of mean field approximation: Transient and steady-state analysis
Mean field approximation is a powerful tool to study the performance of large stochastic
systems that is known to be exact as the system's size N goes to infinity. Recently, it has …
systems that is known to be exact as the system's size N goes to infinity. Recently, it has …
An optimal-control approach to infinite-horizon restless bandits: Achieving asymptotic optimality with minimal assumptions
C Yan - arXiv preprint arXiv:2403.11913, 2024 - arxiv.org
We adopt an optimal-control framework for addressing the undiscounted infinite-horizon
discrete-time restless $ N $-armed bandit problem. Unlike most studies that rely on …
discrete-time restless $ N $-armed bandit problem. Unlike most studies that rely on …