Learning optimal admission control in partially observable queueing networks
From MaRDI portal
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22) Optimal stochastic control (93E20)
Recommendations
- Learning-Based Optimal Admission Control in a Single-Server Queuing System
- Queueing network controls via deep reinforcement learning
- A reinforcement-learning approach for admission control in distributed network service systems
- Learning unknown service rates in queues: a multiarmed bandit approach
- Near-optimal regret bounds for reinforcement learning
Cites work
- A generalisation of Norton's theorem for multiclass queueing networks
- Efficiency of simulation in monotone hyper-stable queueing networks
- Estimating Multiclass Service Demand Distributions Using Markovian Arrival Processes
- Event-based optimization of admission control in open queueing networks
- scientific article; zbMATH DE number 3885030 (Why is no real title available?)
- Near-optimal regret bounds for reinforcement learning
- On the Computational Complexity of Stochastic Controller Optimization in POMDPs
- Parametric Analysis of Queuing Networks
- The Complexity of Markov Decision Processes
- The optimal admission threshold in observable queues with state dependent pricing
- Uniform Stability of Markov Chains
Cited in
(3)
This page was built for publication: Learning optimal admission control in partially observable queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623440)
