A minimal links traversed dynamic rerouting network

Abstract

In the design of fault-tolerant interconnection networks, disjoint paths and dynamic rerouting are often used to tolerate faults. Although providing two more disjoint paths between any source and destination pair could increase reliability, it might not help to decrease collision rate. Rather than using disjoint paths, the method of dynamic rerouting finds an alternative path to the destination when a packet encounters a faulty or busy element. To look after both sides of fault-tolerance and performance, the following items must be carefully concerned to design a dynamic rerouting network. The issues including fault-tolerant capability, low collision rate (throughput) and rerouting hops should be considered. In this paper, we propose a dynamic rerouting network, which can provide an alternative path when a packet meets a faulty or busy element. Besides, the network costs 0-rerouting hops to find the alternative path and performs better static characteristics than other related networks. From the simulation results, the simulation results show that our network has less collision rate and a better throughput than other fault-tolerant networks.