{'fraction_non_alphanumeric': 0.021608643457382955, 'fraction_numerical': 0.0024009603841536613, 'mean_word_length': 5.043478260869565, '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}}
Shuffle-Ring: overcoming the increasing degree of hypercube

The hypercube as a parallel interconnection network has been studied by many for tens of years due to its many merits. However, its increasing node degree is an obvious weakness. Some networks such as the Cube-Connected Circle and the DeBruijn Network have been proposed to overcome the increasing degree of the hypercube. In this paper, we present a new cost-effective network which outperforms the cube network. It can overcome the increasing degree of the cube network while keeping the advantages of the cube network such as logarithmic diameter, easy routing, optimal fault tolerance, and suitability for the ASCEND/DESCEND class of parallel problems. Furthermore, the proposed network achieves the logarithmic diameter with a very small constant node degree, 3 or 4.