{'fraction_non_alphanumeric': 0.013211382113821139, 'fraction_numerical': 0.0, 'mean_word_length': 5.080246913580247, '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}}
Multi-site model and simulation of trunking systems

We consider the case where a number of geographically distributed mobile stations in a trunking system wish to communicate with all other mobile stations belonging to the same group by transmitting messages over a single channel. If the system comprises all these stations, the problem is reduced to allocating every incoming call among the available channels. A multi-site model of trunking systems is proposed and simulated using queuing theory concepts. The results on the performance of this model reveal that its behavior improves if there is the possibility of some unaccessible users in the system. The proposed model requires new call-related parameters: the number of radio units per fleet, the probability distribution vector and the required maximum percentage of unaccessible users per call in progress. For simplicity, we consider a family of fleets and all the users of any fleet uniformly distributed over the sites.