Admission control in UMTS networks based on approximate dynamic programming

DOI10.3166/ejc.14.62-75zbMath1360.93784OpenAlexW2026805420WikidataQ58489739 ScholiaQ58489739MaRDI QIDQ522709

Antonio Pietrabissa

Publication date: 19 April 2017

Published in: European Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3166/ejc.14.62-75

zbMATH Keywords

universal mobile telecommunications system (UMTS)Markov decision process (MDP)approximate dynamic programming (ADP)connection admission control (CAC)

Mathematics Subject Classification ID

Dynamic programming (90C39) Optimal stochastic control (93E20) Markov and semi-Markov decision processes (90C40)

Related Items (6)

Event-based optimization approach for solving stochastic decision problems with probabilistic constraint ⋮ A reinforcement learning approach to call admission and call dropping control in links with variable capacity ⋮ An approximate dynamic programming approach to resource management in multi-cloud scenarios ⋮ Optimal call admission and call dropping control in links with variable capacity ⋮ A new LP formulation of the admission control problem modelled as an MDP under average reward criterion ⋮ A lexicographic approach to constrained MDP admission control

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic programming and suboptimal control: a survey from ADP to MPC
• Matrix Analysis
• Cross-Layer optimal connection admission control for variable bit rate multimedia traffic in packet wireless CDMA networks

This page was built for publication: Admission control in UMTS networks based on approximate dynamic programming