Economies-of-Scale in many-server queueing systems: tutorial and partial review of the QED halfin--whitt heavy-traffic regime
Multiserver queueing systems describe situations in which users require service from
multiple parallel servers. Examples include check-in lines at airports, waiting rooms in …
multiple parallel servers. Examples include check-in lines at airports, waiting rooms in …
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 …
Centralized vs. decentralized ambulance diversion: A network perspective
One of the most important operational challenges faced by emergency departments (EDs) in
the United States is patient overcrowding. In periods of overcrowding, an ED can request the …
the United States is patient overcrowding. In periods of overcrowding, an ED can request the …
Fog load balancing for massive machine type communications: A game and transport theoretic approach
The emerging fog computing and narrow-band Internet of Things (NB-IoT) wireless
technologies are indispensable for the next-generation massive machine-type …
technologies are indispensable for the next-generation massive machine-type …
Join-the-shortest queue diffusion limit in Halfin–Whitt regime: Tail asymptotics and scaling of extrema
S Banerjee, D Mukherjee - 2019 - projecteuclid.org
Consider a system of N parallel single-server queues with unit-ex ponential service time
distribution and a single dispatcher where tasks arrive as a Poisson process of rate λ(N) …
distribution and a single dispatcher where tasks arrive as a Poisson process of rate λ(N) …
JOIN-THE-SHORTEST QUEUE DIFFUSION LIMIT IN HALFIN–WHITT REGIME
S Banerjee, D Mukherjee - The Annals of Applied Probability, 2020 - JSTOR
Consider a system of N parallel single-server queues with unit-exponential service time
distribution and a single dispatcher where tasks arrive as a Poisson process of rate λ (N) …
distribution and a single dispatcher where tasks arrive as a Poisson process of rate λ (N) …
An Approximation to the Invariant Measure of the Limiting Diffusion of G/Ph/n + GI Queues in the Halfin–Whitt Regime and Related Asymptotics
In this paper, we develop a stochastic algorithm based on the Euler–Maruyama scheme to
approximate the invariant measure of the limiting multidimensional diffusion of G/P h/n+ GI …
approximate the invariant measure of the limiting multidimensional diffusion of G/P h/n+ GI …
Diffusion limit of fair resource control—stationarity and interchange of limits
HQ Ye, DD Yao - Mathematics of Operations Research, 2016 - pubsonline.informs.org
We study a resource-sharing network where each job requires the concurrent occupancy of
a subset of links (servers/resources), and each link's capacity is shared among job classes …
a subset of links (servers/resources), and each link's capacity is shared among job classes …
Justifying diffusion approximations for multiclass queueing networks under a moment condition
HQ Ye, DD Yao - 2018 - projecteuclid.org
Multiclass queueing networks (MQN) are, in general, difficult objects to study analytically.
The diffusion approximation refers to using the stationary distribution of the diffusion limit as …
The diffusion approximation refers to using the stationary distribution of the diffusion limit as …
Dynamic flow analysis and crowd management for transfer stations: a case study of Suzhou Metro
J Zhang, Q Ai, Y Ye, S Deng - Public Transport, 2024 - Springer
Transfer stations are important nodes in the metro network, and it is of great significance to
study the coordinated organization scheme between passenger demand and facility …
study the coordinated organization scheme between passenger demand and facility …