A lexicographic approach to constrained MDP admission control
DOI10.1080/00207179.2015.1068955zbMath1332.93387OpenAlexW1491581951MaRDI QIDQ2792714
Guido Oddi, Antonio Pietrabissa, Vincenzo Suraci, Martina Panfili
Publication date: 14 March 2016
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207179.2015.1068955
Markov decision processesstochastic controlcall admission controlcommunication networksreinforcement learning
Learning and adaptive systems in artificial intelligence (68T05) Communication networks in operations research (90B18) Markov and semi-Markov decision processes (90C40)
Related Items (1)
Uses Software
Cites Work
- Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model
- A reinforcement learning approach to call admission and call dropping control in links with variable capacity
- Optimal call admission and call dropping control in links with variable capacity
- Admission control in UMTS networks based on approximate dynamic programming
- Robust stability analysis of Smith predictor-based congestion control algorithms for computer networks
- Reinforcement learning algorithms with function approximation: recent advances and applications
- Design of a bandwidth-on-demand (BoD) protocol for satellite networks modelled as time-delay systems
- Dynamic programming and suboptimal control: a survey from ADP to MPC
- A survey on networking games in telecommunications
- A policy approximation method for the UMTS connection admission control problem modelled as an MDP
- Cross-Layer optimal connection admission control for variable bit rate multimedia traffic in packet wireless CDMA networks
- An Alternative LP Formulation of the Admission Control Problem in Multiclass Networks
This page was built for publication: A lexicographic approach to constrained MDP admission control
