{'fraction_non_alphanumeric': 0.02023121387283237, 'fraction_numerical': 0.010597302504816955, 'mean_word_length': 4.772222222222222, '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}}
Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes

The dual-cube is a newly proposed interconnection network for linking a large amount of nodes with low node degree. It uses low-dimensional hypercubes as building blocks and keeps the main desired properties of the hypercubes. In this paper, we give an efficient algorithm for fault tolerant routing in dual-cube networks with a large number of faulty nodes. Our algorithm uses the adaptive-subcube technique to select a suitable dimension to route a node. This technique not only increases the routing speed but also shortens the path and improves the successful routing rate. The experimental results show that, with high percentages of node failures, the algorithm can build routing paths with a very high probability. Our simulation results show that when a dual-cube with 32,768 nodes contains up to 20 percent faulty nodes, the success rate of constructing a faultfree path between any two nonfaulty nodes is 99.5 percent with a 4-subcube.