A reinforcement learning approach to call admission and call dropping control in links with variable capacity
From MaRDI portal
Publication:431777
DOI10.3166/EJC.17.89-103zbMath1248.93177OpenAlexW2062269956WikidataQ58489639 ScholiaQ58489639MaRDI QIDQ431777
Publication date: 3 July 2012
Published in: European Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3166/ejc.17.89-103
Related Items (3)
An approximate dynamic programming approach to resource management in multi-cloud scenarios ⋮ A lexicographic approach to constrained MDP admission control ⋮ A stochastic control approach to Slotted-ALOHA random access protocol
Cites Work
- Unnamed Item
- Optimal call admission and call dropping control in links with variable capacity
- Admission control in UMTS networks based on approximate dynamic programming
- Optimal policies for controlled Markov chains with a constraint
- Reinforcement learning for call admission control and routing under quality of Service constraints in multimedia networks
- COMPUTING AVERAGE OPTIMAL CONSTRAINED POLICIES IN STOCHASTIC DYNAMIC PROGRAMMING
- 10.1162/153244303768966148
- Time-average optimal constrained semi-Markov decision processes
- ${Q}$-Learning Algorithms for Constrained Markov Decision Processes With Randomized Monotone Policies: Application to MIMO Transmission Control
- Cross-Layer optimal connection admission control for variable bit rate multimedia traffic in packet wireless CDMA networks
This page was built for publication: A reinforcement learning approach to call admission and call dropping control in links with variable capacity