DocumentCode
3125977
Title
An Improved Call Admission Control Scheme Based on Reinforcement Learning for Multimedia Wireless Networks
Author
Chen, Yueyun ; Jia, Cuixia
Author_Institution
Dept. of Inf. & Commun. Eng., Univ. of Sci. & Technol. Beijing, Beijing, China
fYear
2009
fDate
28-29 Dec. 2009
Firstpage
322
Lastpage
325
Abstract
This paper presents an improved call admission control scheme to optimize the network operators´ revenue while guarantying the quality of service (QoS) to the mobile terminals. The problem of call admission control (CAC) is modeled as a Semi-Markov decision process (SMDP), and the SMDP is solved by a reinforcement learning (RL) algorithm known as Q-learning. In the Q-learning algorithm, the reward functions for the acceptance and the rejection of new calls for each class of service not only depend on used bandwidth, new call arrival rate, average service time and price, but also the ratio of new call load and the handoff call load and the requested bandwidth of each class of traffic. The CAC scheme would be well performed through the reward functions. Simulations results show that the CAC scheme can obtain high revenue while greatly reducing handoff call dropping probability when the traffic loads are heavy.
Keywords
Markov processes; learning (artificial intelligence); multimedia communication; quality of service; telecommunication congestion control; call admission control; call arrival rate; handoff call dropping probability; multimedia wireless networks; quality of service; reinforcement learning; reward functions; semi-Markov decision process; Bandwidth; Call admission control; Information systems; Learning; Multimedia systems; Quality of service; Resource management; Telecommunication traffic; Traffic control; Wireless networks; call admission control; quality of service; reinforcement learning; reward function;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Networks and Information Systems, 2009. WNIS '09. International Conference on
Conference_Location
Shanghai
Print_ISBN
978-0-7695-3901-0
Electronic_ISBN
978-1-4244-5400-6
Type
conf
DOI
10.1109/WNIS.2009.91
Filename
5381954
Link To Document