{'fraction_non_alphanumeric': 0.020697167755991286, 'fraction_numerical': 0.0, 'mean_word_length': 5.426573426573427, '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 self-adaptive threshold based scheduling algorithm for input-queued switches

This paper presents a self-adaptive threshold based round-robin scheduling algorithm SATRR for input-queued switches. In SATRR, the matched input and output in certain cell time will be locked by two self-adaptive thresholds, whenever the queue length or the wait-time of the head cell in corresponding virtual output queue (VOQ) exceeds the thresholds. For a pair of locked input and output, they will be matched directly during succeeding cell times until unlocked. Particularly, by simultaneously employing the queue length threshold and the wait-time threshold which are updated every cell time, SATRR archives a good tradeoff between performance and hardware complexity. Simulation results indicate that the delay performance of SATRR is competitive when compared to other typical scheduling algorithms under various traffic patterns