{'fraction_non_alphanumeric': 0.0289193302891933, 'fraction_numerical': 0.0060882800608828, 'mean_word_length': 4.927927927927928, '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}}
An Adaptive Wormhole Routhing using Virtual Channels in K-ary n-cubes

This paper is based on multicasting model in k-ary n-cubes, and Proposes an adaptive wormhole routing algorithm which allows faults and channel contention. The proposed algorithm only requires virtual channels per physical channel which is proportional to the dimension n in order to allow (n-1) faults in a k-ary n-cube. This method uses smaller number of virtual channels than the previously Proposed adaptive routing algorithms [5, 18]. Through a chaos simulator, we have measured message delay considering fault-tolerant as well as message traffic to our adaptive routing algorithm.