{'fraction_non_alphanumeric': 0.019447287615148412, 'fraction_numerical': 0.0, 'mean_word_length': 5.653061224489796, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A probabilistic approach for fair-efficient call admission control in wireless multiservice networks

The efficiency of call admission control (CAC) schemes in multiclass wireless networks should be evaluated not only with regard to the call blocking probability (CBP) achieved for every service class (SC) supported but also with regard to quality of service (QoS) and network efficiency criteria. In this article, four CAC schemes offering priority to SCs of advanced QoS requirements, based on guard channel policy, are studied and evaluated taking into account fairness and throughput criteria in addition to CBP. For the performance evaluation of the proposed CAC schemes and to examine fairness issues, two fairness indices are introduced along with a throughput metric. The analytical results, validated through extensive simulations, indicate that by appropriate selection of the CAC parameters satisfactory fairness and throughput are achieved while achieving low CBP.