{'fraction_non_alphanumeric': 0.02511773940345369, 'fraction_numerical': 0.0, 'mean_word_length': 5.042654028436019, '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': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Development of an Adaptive Multipath Routing Algorithm by Examining the Congestion and Channel Fault of One-Hop Nodes in Network-on-Chip

As the complexity of system-on-chips increased, new network-on-chips have been introduced in a multi-core system with new communication design. Increasing the capacity of network-on-chip will increase the faults and congestion in the network. To deal with these challenges, an efficient routing algorithm is required. Given that most routing algorithms only examine the position of the adjacent channel, they may send the packets to a congestive or defective region. In this case, the delay will increase, and as a result, the network performance decreases. In present study, an adaptive routing algorithm is proposed for a two-dimensional mesh. This algorithm examines the channels of neighboring nodes, in addition to the congestion and faults of adjacent channels. Finally, according to the information of the channels of neighboring nodes, it identifies those paths causing the packet loss, and selects an alternative route with the least congestion to send the packets; this increases the reliability of the network. The simulation results show that lower time delay and higher throughput can be obtained for different error rates.