Constraint optimization in call admission control domain with a NeuroEvolution algorithm

Authors:
Xu Yang;John Bigham
Affiliations:
Macao Polytechnic Institute, Macao SAR, China;Queen Mary University of London, London, United Kingdom
Venue:
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Year:
2008

Citing 6
Cited 0

On optimal call admission control in cellular networks

Wireless Networks
Call admission control in cellular networks: a reinforcement learning solution

International Journal of Network Management
A unified bandwidth reservation and admission control mechanism for QoS provisioning in cellular networks: Research Articles

Wireless Communications & Mobile Computing - Performance Evaluation of Wireless Networks
Radio Resource Management for Multimedia Qos Support in Wireless Networks

Radio Resource Management for Multimedia Qos Support in Wireless Networks
Integrated connection-level and packet-level QoS controls over wireless mesh networks

Journal of Parallel and Distributed Computing
A call admission control scheme using neuroevolution algorithm in cellular networks

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The objective for Call admission control (CAC) is to accept or reject request calls so as to maximize the expected revenue over an infinite time period and maintain the predefined QoS constraints. This is a non-linear constraint optimization problem. This paper analyses the difficulties when handling QoS constraints in the CAC domain, and implements two constraint handling methods that cooperate with a NeuroEvolution algorithm called NEAT to learn CAC policies. The two methods are superiority of feasible points and static penalty functions. The simulation results are compared based on two evolution parameters: the ratio of feasible policies, and the ratio of "all accept' policies. Some researchers argue that superiority of feasible points may fail when the feasible region is quite small compared with the whole search space, however the speciation and complexification features of NEAT makes it a very competitive method even in such cases.