Ergodic Diffusion Control of Multiclass Multi-Pool Networks in the Halfin-Whitt Regime
Ari Arapostathis, Guodong Pang

TL;DR
This paper studies ergodic diffusion control problems in complex multiclass multi-pool networks within the Halfin-Whitt regime, providing explicit drift representations and characterizing optimal controls under constraints.
Contribution
It introduces a recursive leaf elimination algorithm for explicit drift representation and extends the framework to constrained ergodic diffusion control problems.
Findings
Existence of stationary Markov controls ensuring geometric ergodicity.
Explicit drift representation via the recursive leaf elimination algorithm.
Characterization of optimal controls through HJB equations.
Abstract
We consider Markovian multiclass multi-pool networks with heterogeneous server pools, each consisting of many statistically identical parallel servers, where the bipartite graph of customer classes and server pools forms a tree. Customers form their own queue and are served in the first-come first-served discipline, and can abandon while waiting in queue. Service rates are both class and pool dependent. The objective is to study the limiting diffusion control problems under the long run average (ergodic) cost criteria in the Halfin--Whitt regime. Two formulations of ergodic diffusion control problems are considered: (i) both queueing and idleness costs are minimized, and (ii) only the queueing cost is minimized while a constraint is imposed upon the idleness of all server pools. We develop a recursive leaf elimination algorithm that enables us to obtain an explicit representation of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
