{'fraction_non_alphanumeric': 0.013636363636363636, 'fraction_numerical': 0.0, 'mean_word_length': 5.364161849710983, '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}}
Complete partitioning schemes for call access control in ATM networks

A CAC scheme is considered and different alternatives to compute the maximum number of acceptable calls for each traffic class involved are evaluated. The traffic is considered divided in traffic classes, characterised by statistical parameters like peak and average bandwidth and burstiness, and by specific performance requirements. A "feasibility region" where performance requirements are surely satisfied is defined and a model to describe the call acceptance method is presented. Then, three alternative strategies to get the maximum number of acceptable connections, by taking into account the probability of blocking a call at the call set-up, are described. The first one is intended to minimise an overall measure of the call blocking probability, the second is aimed to balance the probability between the different traffic classes while the last one allows to have a constraint on the call blocking probability. All the strategies are tested by simulation and compared with other mechanisms already in the literature.