{'fraction_non_alphanumeric': 0.018975332068311195, 'fraction_numerical': 0.0, 'mean_word_length': 5.355421686746988, '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}}
Performance Evaluation of a Non-exhaustive Polling System with Asymmetrical Finite Queues

Polling systems have a broad range of applications, e.g., in modeling approaches for many communications, computer and switching networks, where a service providing source is shared by several users or terminals. By having an intention to investigate the performance analysis of polling systems with asymmetrical finite queues, a simple parsimonious polling model with asymmetrical finite queues is presented in this paper. We develop a new method to solve polling system with asymmetrical queues with Markov chains and simultaneously solve all of them iteratively, to make extensions and improvements in our previous results which were with symmetrical queues. We analyze the performance parameters of the considered polling system, e.g., probabilities that the queue is empty, mean number of customers in the queue, loss probabilities of customers and the mean flow time of customers in the system. All the analytical results are verified by simulation results.