On QoS Guarantees With Reward Optimization for Servicing Multiple Priority Classes in Wireless Networks

Authors report performance characteristics of a class of Call Admission Control (CAC) algorithms designed for servicing multiple priority classes in wireless networks with the goal of Quality of Service (QoS) satisfaction and reward optimization. By reward, they mean some sort of "Value" obtained by the system as a result of servicing multiple priority classes. In this paper authors design and evaluate the performance of a new algorithm, elastic threshold-based CAC, in terms of the maximum reward obtainable with QoS satisfaction from servicing multiple priority classes with distinct QoS requirements, and compare it with existing partitioning, threshold, and spillover CAC algorithms.