Optimal Control of Multiclass Fluid Queueing Networks: A Machine Learning Approach
Not on the map. Why?
Abstract (arXiv)
We propose a machine learning approach to the optimal control of multiclass fluid queueing networks (MFQNETs) that provides explicit and insightful control policies. We prove that a piecewise constant optimal policy exists for MFQNET control problems, with segments separated by hyperplanes passing through the origin. We use Optimal Classification Trees with hyperplane splits (OCT-H) to learn an optimal control policy for MFQNETs. We use numerical solutions of MFQNET control problems as a training set and apply OCT-H to learn explicit control policies. Furthermore, we show that both the theoretical results and the proposed algorithm extend to robust MFQNETs with uncertain service and arrival rates. We report experimental results with up to 33 servers and 99 classes that demonstrate that the learned policies achieve 100% accuracy on the test set. While the offline training of OCT-H can take days in large networks, the online application takes milliseconds.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 9 of its 67 references that are in the map. First posted on arXiv 23 Jul 2023.
Builds on
9 of 67 references.
References · 9
- 2018Programmatically Interpretable Reinforcement Learningcited by 193
- 2018Verifiable Reinforcement Learning via Policy Extractioncited by 177
- 2020Queueing Network Controls via Deep Reinforcement Learningcited by 41
- 2019Online Mixed-Integer Optimization in Millisecondscited by 38
- 2018The Voice of Optimizationcited by 28
- 2021CoCo: Online Mixed-Integer Control via Supervised Learningcited by 16
- 2021Queue-Learning: A Reinforcement Learning Approach for Providing Quality of Servicecited by 7
- 2019Learning to Optimize Computational Resources: Frugal Training with Generalization Guaranteescited by 5
- 2021Revised SCLP-simplex Algorithm with Application to Large-Scale Fluid Processing Networkscited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.