{'fraction_non_alphanumeric': 0.02047082906857728, 'fraction_numerical': 0.0, 'mean_word_length': 5.150943396226415, '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 analysis of a novel ring-based multi-polling algorithm for crosspoint buffered switches

In this paper, we propose a novel ring-based multi-polling algorithm for combined input and crosspoint queued (CICQ) switches. Our scheme is based on a multi-token ring connecting the crosspoints of an output column in the switch matrix and the scheduling procedure is scalable and distributed over crosspoints. Our approach belongs to maximum weight matching algorithms, where the queue length and the cell waiting time in the crosspoint buffers are used as weights. The instability problem of CICQ switches is eliminated. To realize the cell scheduling policies according to the queue length and the cell waiting time, a few difficulties will be encountered. Our proposed algorithm can overcome these issues. To evaluate the performance, we conduct several simulations. From the results, our algorithm satisfies the requirements of feasible and low cost and high efficiency.