{'fraction_non_alphanumeric': 0.026359143327841845, 'fraction_numerical': 0.0, 'mean_word_length': 4.846153846153846, '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}}
Design of non-blocking permutation generator

The Banyan network is a popular and basic structure of multistage ATM switches. This paper presents a novel approach to resolve the internal blocking of the banyan network by using a nonblocking permutation generator (NBPG). The NBPG performs two functions, i.e., the first function is to extract the conflict cells from the incoming cells and the second function is to re-assign new input port addresses to the conflict cells. As a result, NBPG generates nonblocking I/O permutations. To estimate the performance of NBPG, we provide several simulation results.