Based Load Balancing In Hypercube Networks, Fault-tolerant Routing Algorithm

Hypercube network is one of the most important and attractive network topologies so far. Based on a thorough investigation on congestion control, flow control and load balancing problems on current networks, we design and develop unicast fault tolerant routing algorithms on hypercube networks with load balancing support.We study validity and safeguard on fault tolerant routing on hypercube networks. The existing fault tolerant models and fault tolerant routing algorithms on hypercube networks are short of security and validity, so they can not avoid deadlock, conflict and message congestion on routing. Moreover, very few researches on load balancing can be found on the hypercube networks. Based on the comprehensive understanding of flow control, congestion control and load balancing on current networks, we concentrate on the applicability of these techniques on the structures and fault tolerant routing algorithms on hypercube networks.Based on load balancing, we improved the original unicast fault tolerant routing algorithms on locally-connected hypercube networks. The new algorithms are simple and efficient. Firstly, these algorithms are applicable no matter whether the given hypercube network satisfies the requirements or not: in case the network is locally connected, the algorithms successfully construct the routing path with load balancing support, while in case our algorithms fail in finding a routing path, they report correctly that the network is not locally connected. Secondly, Our routing algorithms are distributed and local-information-based in the sense that each node in the network knows only its neighbors' status and no global information of the network is required by the algorithms. Above all, validity is improved more in our routing algorithms. The simulation results show that, not only load balancing is reached, the probability of successfully finding routing paths is also increased.