A policy approximation method for the UMTS connection admission control problem modelled as an MDP

DOI10.1080/00207170902774233zbMath1178.93090OpenAlexW2154150516WikidataQ58489694 ScholiaQ58489694MaRDI QIDQ3654578

Antonio Pietrabissa

Publication date: 6 January 2010

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

Full work available at URL: https://doi.org/10.1080/00207170902774233

zbMATH Keywords

Markov decision processescommunication networksconnection admission controlapproximated dynamic programmingUMTS networks

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Communication networks in operations research (90B18) Discrete-time control/observation systems (93C55) Dynamic programming (90C39)

Related Items (5)

Region-based approximation in approximate dynamic programming ⋮ 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 ⋮ Allocating resources via price management systems: a dynamic programming-based approach

Uses Software

• LPbook

Cites Work

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

This page was built for publication: A policy approximation method for the UMTS connection admission control problem modelled as an MDP