Mean field approximations to a queueing system with threshold-based workload control scheme

DOI10.1080/03610926.2021.1983601arXiv1802.07363OpenAlexW3205107793MaRDI QIDQ6107563

Yiqiang Q. Zhao, Li-Wei Liu, Qihui Bu

Publication date: 3 July 2023

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

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

zbMATH Keywords

Markov processmean field limitjoin-the-shortest queuethreshold service queue

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• The mean-field computation in a supermarket model with server multiple vacations
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• Fast Jackson networks
• Choosing among heterogeneous server clouds
• Balancing queues by mean field interaction
• Randomized longest-queue-first scheduling for large-scale buffered systems
• Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems
• The Power of Slightly More than One Sample in Randomized Load Balancing

This page was built for publication: Mean field approximations to a queueing system with threshold-based workload control scheme