Realizing Fault-Tolerant Interconnection Networks Via Chaining
IEEE Transactions on Computers - Fault-Tolerant Computing
IEEE Transactions on Computers
The B-Network: A Multistage Interconnection Network with Backward Links
IEEE Transactions on Computers
Destination Tag Routing Techniques Based on a State Model for the IADM Network
IEEE Transactions on Computers
The SP2 high-performance switch
IBM Systems Journal
CGIN: A Fault Tolerant Modified Gamma Interconnection Network
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Performance and fault tolerance improvements in the Inverse Augmented Data Manipulator network
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
3-disjoint gamma interconnection networks
Journal of Systems and Software
Designing A Disjoint Paths Interconnection Network with Fault Tolerance and Collision Solving
The Journal of Supercomputing
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
The Journal of Supercomputing
Journal of Electrical and Computer Engineering
| Hi-index | 0.01 |
In fault-tolerant multistage interconnection design, the method of providing disjoint paths can tolerate faults, but it is complicated and hard to choose a collision-free path in disjoint paths networks. A network with disjoint paths can concurrently send more identical packets from the source node to increase the arrival ratio or backtrack a packet to the source and take the other disjoint path, but these two methods might increase the collision ratio. In contrast, a dynamic rerouting method finds an alternative path that tolerates faults or prevents collisions. In this paper, we present methods of designing dynamic rerouting networks. This paper presents (1) three design schemes of dynamic rerouting networks to tolerate faults and prevent collisions; (2) design schemes that enable a dynamic rerouting network to use destination tag routing to save hardware cost in switches for computing rerouting tags; (3) a method to prevent a packet from re-encountering the faulty element again after rerouting to reduce the number of rerouting hops and improve the arrival ratio; and (4) simulation results of related dynamic rerouting networks to realize the factors which influence the arrival ratio including the fault tolerant capability and the number of rerouting hops. According to our proposed design schemes and according to our analysis and simulation results, a designer can choose an applicable dynamic rerouting network by using cost-efficient considerations.