Designing A Disjoint Paths Interconnection Network with Fault Tolerance and Collision Solving

Authors:
Ching-Wen Chen;Chung-Ping Chung
Affiliations:
Department of Computer Science and Information Engineering, Chaoyang University of Technology, Wufeng, Taichung County, ROC 413;Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, ROC 300
Venue:
The Journal of Supercomputing
Year:
2005

Citing 9
Cited 3

A Survey and Comparision of Fault-Tolerant Multistage Interconnection Networks

Computer
The Extra Stage Gamma Network

IEEE Transactions on Computers
The PM221 Interconnection Network

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
CGIN: A Fault Tolerant Modified Gamma Interconnection Network

IEEE Transactions on Parallel and Distributed Systems
Throughput Analysis of B-Networks

IEEE Transactions on Computers
The Composite Banyan Network

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

Design schemes of dynamic rerouting networks with destination tag routing for tolerating faults and preventing collisions

The Journal of Supercomputing
Designing a Fault-tolerant Fully-Chained Combining Switches Multi-stage Interconnection Network with Disjoint Paths

The Journal of Supercomputing
Message broadcasting via a new fault tolerant irregular advance omega network in faulty and nonfaulty network environments

Journal of Electrical and Computer Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In fault-tolerant interconnection designs, many prior researches suggest good use of disjoint paths to improve the reliability of interconnection networks. Although disjoint paths increase reliability, they always cost the throughput penalty. To address the problems of both performance and fault-tolerant capability, the following issues should be carefully considered: (1) guarantee of at least two disjoint paths, (2) easy rerouting between disjoint paths, (3) keep low rerouting hops, (4) solve the occurrences of packets' collision. In this paper, we consider these issues to design a fault-tolerant network called CSMIN (Combining Switches Multistage Interconnection Network). CSMIN provides two disjoint paths to guarantee one fault-tolerant and can dynamically reroute packets between these two paths to solve the collision situation. In other words, to switch packets between these two disjoint paths easily, CSMIN causes these two disjoint paths to have regular distances at each stage. Accordingly, a packet can be dynamically sent to the other disjoint path if it encounters a faulty or busy element. In addition, CSMIN presents low rerouting hops (an average of one rerouting hop) to maintain a low collision ratio. From the simulation result, CSMIN performs with a better arrival ratio than Gamma and other related disjoint paths networks do.