Supermarket model on graphs

DOI10.1214/18-AAP1437zbMath1412.60051arXiv1712.07607OpenAlexW3104485549WikidataQ128341055 ScholiaQ128341055MaRDI QIDQ2415512

Amarjit Budhiraja, Debankur Mukherjee, Ruoyu Wu

Publication date: 22 May 2019

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.07607

zbMATH Keywords

functional limit theoremsMcKean-Vlasov processmany-server asymptoticsasymptotic decouplingload balancing on networkpower-of-$d$ scheme

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Functional limit theorems; invariance principles (60F17) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (10)

Analysis of large urn models with local mean-field interactions ⋮ Stationarity and uniform in time convergence for the graphon particle system ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ Graphon particle system: uniform-in-time concentration bounds ⋮ Graphon mean field systems ⋮ Propagation of chaos and large deviations in mean-field models with jumps on block-structured networks ⋮ Stability of JSQ in queues with general server-job class compatibilities ⋮ Mean field interaction on random graphs with dynamically changing multi-color edges ⋮ Weakly interacting particle systems on inhomogeneous random graphs ⋮ Power-of-two sampling in redundancy systems: the impact of assignment constraints

This page was built for publication: Supermarket model on graphs