Fault-Tolerant Routing With Load Balancing in LeTQ Networks

With the increasing scale of parallel computer interconnection network, the possibility of processor failure or link failure between processors in the network is also increasing. In the design of supercomputers, not only link overhead and communication delay should be taken into account, but also fault-tolerant performance of networks should be emphasized. Locally exchanged twisted cube (<inline-formula><tex-math notation="LaTeX">$LeTQ$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>L</mml:mi><mml:mi>e</mml:mi><mml:mi>T</mml:mi><mml:mi>Q</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="fan-ieq1-3126627.gif"/></alternatives></inline-formula>) is a newly proposed interconnection network with lower link overhead and shorter diameter. With the increasing scale of supercomputers, fault-tolerant routing is indispensable. In this article, we propose a new load balancing fault-tolerant routing algorithm based on node contraction for <inline-formula><tex-math notation="LaTeX">$LeTQ$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>L</mml:mi><mml:mi>e</mml:mi><mml:mi>T</mml:mi><mml:mi>Q</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="fan-ieq2-3126627.gif"/></alternatives></inline-formula> networks. The proposed algorithm uses the node shrinkage method to evaluate the priority of nodes. The sending node adaptively adjusts the probability of forwarding packets to the neighbor node according to the priority of the neighbor node and the state of the network. The path can be adapted to the load state of the network. The simulation results show that the fault-tolerant routing algorithm has good performance in throughput and delay.