Parallel server systems under an extended heavy traffic condition: a lower bound
DOI10.1214/23-aap1984arXiv2201.07855OpenAlexW4391480508MaRDI QIDQ6126794
Rami Atar, Martin I. Reiman, Eyal Castiel
Publication date: 10 April 2024
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.07855
Hamilton-Jacobi-Bellman equationheavy trafficdiffusion limitsBrownian control problemstrict complementary slacknessparallel server systems
Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Diffusion processes (60J60) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Controlled stochastic networks in heavy traffic: convergence of value functions
- Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy
- Diffusion approximations for controlled stochastic networks: an asymptotic bound for the value function
- Representations of Markov processes as multiparameter time changes
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- Brownian models of open processing networks: Canonical representation of workload.
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Heavy traffic resource pooling in parallel-server systems
- On diffusion approximation with discountinuous coefficients.
- Dynamic scheduling for parallel server systems in heavy traffic: Graphical structure, decoupled workload matrix and some sufficient conditions for solvability of the Brownian control problem
- Resource pooling in queueing networks with dynamic routing
- Controlled queues in heavy traffic
- OPTIMAL ROUTING IN OUTPUT-QUEUED FLEXIBLE SERVER SYSTEMS
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
This page was built for publication: Parallel server systems under an extended heavy traffic condition: a lower bound
