Comparative Performance Analysis of CAC Reward Optimization Algorithms in Wireless Networks

In this paper, we perform a comparative analysis of a set of call admission control (CAC) algorithms designed for servicing multiple priority classes in wireless networks with quality of service (QoS) guarantees. We evaluate the performance of partitioning, threshold-based, spillover, and elastic-threshold CAC algorithms in terms of the maximum number of mobile users the system is able to support with QoS satisfaction while maximizing the "reward" obtainable from servicing multiple priority classes with distinct QoS requirements. We compare these algorithms thoroughly with test cases generated through a combination of user workload, mobility, location, and population. We verify analytical results via simulation validation using real mobility trace data to model user mobility. We also analyze the tradeoff between solution optimality vs. solution efficiency in designing CAC algorithms for reward optimization and QoS satisfaction when servicing multiple service classes with distinct QoS requirements in wireless networks.