A novel design layout of three disjoint paths multistage interconnection network & its reliability analysis

2021 ◽  
Vol 17 (4) ◽  
pp. 390-403
Author(s):  
Vipin Sharma ◽  
Abdul Q. Ansari ◽  
Rajesh Mishra
Keyword(s):  
Fault Tolerance ◽  
Interconnection Networks ◽  
Interconnection Network ◽  
High Reliability ◽  
Block Diagram ◽  
Low Cost ◽  
Disjoint Paths ◽  
Content Type ◽  
Multistage Interconnection Network ◽  
Terminal Reliability

Purpose The purpose of this paper is to design a efficient layout of Multistage interconnection network which has cost effective solution with high reliability and fault-tolerence capability. For parallel computation, various multistage interconnection networks (MINs) have been discussed hitherto in the literature, however, these networks always required further improvement in reliability and fault-tolerance capability. The fault-tolerance capability of the network can be achieved by increasing the number of disjoint paths as a result the reliability of the interconnection networks is also improved. Design/methodology/approach This proposed design is a modification of gamma interconnection network (GIN) and three disjoint path gamma interconnection network (3-DGIN). It has a total seven number of paths for all tag values which is uniform out of these seven paths, three paths are disjoint paths which increase the fault tolerance capability by two faults. Due to the presence of more paths than the GIN and 3-DGIN, this proposed design is more reliable. Findings In this study, a new design layout of a MIN has been proposed which provides three disjoint paths and uniformity in terms of an equal number of paths for all source-destination (S-D) pairs. The new layout contains fewer nodes as compared to GIN and 3-DGIN. This design provides a symmetrical structure, low cost, better terminal reliability and provides an equal number of paths for all tag values (|S-D|) when compared with existing MINs of this class. Originality/value A new design layout of MINs has been purposed and its two terminal reliability is calculated with the help of the reliability block diagram technique.

Designing a New Class of Fault Tolerant Multistage Interconnection Networks

2005 ◽  
Vol 06 (04) ◽  
pp. 361-382 ◽  
Author(s):  
K. V. Arya ◽  
R. K. Ghosh
Keyword(s):  
Fault Tolerance ◽  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Multistage Interconnection Networks ◽  
Multistage Interconnection Network ◽  
New Class

This paper proposes a technique to modify a Multistage Interconnection Network (MIN) to augment it with fault tolerant capabilities. The augmented MIN is referred to as Enhanced MIN (E-MIN). The technique employed for construction of E-MIN is compared with the two known physical fault tolerance techniques, namely, extra staging and chaining. EMINs are found to be more generic than extra staged networks and less expensive than chained networks. The EMIN realizes all the permutations realizable by the original MIN. The routing strategies under faulty and fault free conditions are shown to be very simple in the case of E-MINs.

Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions

2019 ◽  
Vol 30 (08) ◽  
pp. 1301-1315 ◽  
Author(s):  
Liqiong Xu ◽  
Shuming Zhou ◽  
Weihua Yang
Keyword(s):  
Fault Tolerance ◽  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Cayley Graphs ◽  
Disjoint Paths ◽  
Local Connectivity ◽  
Communication Links ◽  
Restricted Condition ◽  
Vertex Disjoint

An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processors and communication links, respectively. Connectivity is an important metric for fault tolerance of interconnection networks. A graph [Formula: see text] is said to be maximally local-connected if each pair of vertices [Formula: see text] and [Formula: see text] are connected by [Formula: see text] vertex-disjoint paths. In this paper, we show that Cayley graphs generated by [Formula: see text]([Formula: see text]) transpositions are [Formula: see text]-fault-tolerant maximally local-connected and are also [Formula: see text]-fault-tolerant one-to-many maximally local-connected if their corresponding transposition generating graphs have a triangle, [Formula: see text]-fault-tolerant one-to-many maximally local-connected if their corresponding transposition generating graphs have no triangles. Furthermore, under the restricted condition that each vertex has at least two fault-free adjacent vertices, Cayley graphs generated by [Formula: see text]([Formula: see text]) transpositions are [Formula: see text]-fault-tolerant maximally local-connected if their corresponding transposition generating graphs have no triangles.

Effect of Different Connection Patterns of MUX and DEMUX on Terminal Reliability and Routing Scheme of Gamma-Minus MIN

2018 ◽  
Vol 25 (03) ◽  
pp. 1850013 ◽  
Author(s):  
Shilpa Gupta ◽  
G. L. Pahuja
Keyword(s):  
Fault Tolerance ◽  
Communication Systems ◽  
Interconnection Network ◽  
Low Cost ◽  
Reliability Evaluation ◽  
Performance Measure ◽  
Cost Ratio ◽  
Performance Indices ◽  
Network Topologies ◽  
Terminal Reliability

In parallel and distributed systems, multistage interconnection network (MIN) plays an important role for its efficient communication between processor and memory at a very low cost. A major class of MIN called Gamma network is known for its redundant network topology and is being used in broadband communication systems. The increased redundancy incorporation makes these networks more complex and hence reliability evaluation becomes complex. The performance evaluation of these network topologies requires reliability evaluation utilizing routing mechanism or techniques. In this paper, we have proposed four topologies of Gamma-Minus network using MUX and DEMUX. Terminal Reliability (TR), fault tolerance and routing schemes of Gamma-Minus network topologies proposed have been computed by utilizing different connection patterns of MUX/DEMUX. Also, performance indices such as TR, Reliability Cost Ratio (RCR), Fault Tolerance, etc. computed for different Gamma-Minus architectures have been compared with the existing Gamma networks, other than Gamma-Minus. All the performance indices for different Gamma-Minus topologies show improvement over the performance indices of different Gamma networks. The proposed Gamma-Minus architectures have been compared among themselves and also Gamma-Minus2 shows the best performance for all performance indices. To the best of our knowledge, most of the researchers have not compared fault tolerance and RCR performance measure.

SEGIN-Minus: A New Approach to Design Reliable and Fault-Tolerant MIN

2020 ◽  
Vol 13 (3) ◽  
pp. 370-380
Author(s):  
Shilpa Gupta ◽  
Gobind Lal Pahuja
Keyword(s):  
Fault Tolerance ◽  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Network Reliability ◽  
Low Cost ◽  
Destination Node ◽  
Node Pair ◽  
Output Terminal ◽  
Multiple Processors

Background: VLSI technology advancements have resulted the requirements of high computational power, which can be achieved by implementing multiple processors in parallel. These multiple processors have to communicate with their memory modules by using Interconnection Networks (IN). Multistage Interconnection Networks (MIN) are used as IN, as they provide efficient computing with low cost. Objective: the objective of the study is to introduce new reliable MIN named as a (Shuffle Exchange Gamma Interconnection Network Minus) SEGIN-Minus, which provide reliability and faulttolerance with less number of stages. Methods: MUX at input terminal and DEMUX at output terminal of SEGIN has been employed with reduction in one intermidiate stage. Fault tolerance has been introduced in the form of disjoint paths formed between each source-destnation node pair. Hence reliability has been improved. Results: Terminal, Broadcast and Network Reliability has been evaluated by using Reliability Block Diagrams for each source-destination node pair. The results have been shown, which depicts the hiher reliability values for newly proposed network. The cost analysis shows that new SEGINMinus is a cheaper network than SEGIN. Conclusion: SEGIN-Minus has better reliability and Fault-tolerance than priviously proposed SEGIN.

Component Edge Connectivity of Hypercubes

2018 ◽  
Vol 29 (06) ◽  
pp. 995-1001 ◽  
Author(s):  
Shuli Zhao ◽  
Weihua Yang ◽  
Shurong Zhang ◽  
Liqiong Xu
Keyword(s):  
Fault Tolerance ◽  
Complete Graph ◽  
Interconnection Networks ◽  
Interconnection Network ◽  
Optimal Solutions ◽  
Edge Connectivity ◽  
Important Measure ◽  
Minimum Number ◽  
Text Component

Fault tolerance is an important issue in interconnection networks, and the traditional edge connectivity is an important measure to evaluate the robustness of an interconnection network. The component edge connectivity is a generalization of the traditional edge connectivity. The [Formula: see text]-component edge connectivity [Formula: see text] of a non-complete graph [Formula: see text] is the minimum number of edges whose deletion results in a graph with at least [Formula: see text] components. Let [Formula: see text] be an integer and [Formula: see text] be the decomposition of [Formula: see text] such that [Formula: see text] and [Formula: see text] for [Formula: see text]. In this note, we determine the [Formula: see text]-component edge connectivity of the hypercube [Formula: see text], [Formula: see text] for [Formula: see text]. Moreover, we classify the corresponding optimal solutions.

Internally Vertex-Disjoint Paths in Crossed Cube-Connected Ring Networks

2013 ◽  
Vol 321-324 ◽  
pp. 2715-2720
Author(s):  
Xin Yu ◽  
Gao Cai Wang ◽  
Yan Yu
Keyword(s):  
Interconnection Networks ◽  
Interconnection Network ◽  
Disjoint Paths ◽  
Ring Networks ◽  
Vertex Disjoint ◽  
Crossed Cube

Crossed cube is a variation of hypercube, but some properties of the former are superior to those of the latter. However, it is difficult to extend the scale of crossed cube networks. As a kind of hierarchical ring interconnection networks, crossed cube-connected ring interconnection network CRN can effectively overcome the disadvantage. Hence, it is a good topology for interconnection networks. In this paper, we prove that there exist n internally vertex-disjoint paths between any two vertexes in CRN, and analyze the lengths of the paths.

Modified Gamma Network: Design and Reliability Evaluation

2019 ◽  
Vol 13 ◽  
Author(s):  
Shilpa Gupta ◽  
Gobind Lal Pahuja
Keyword(s):  
Fault Tolerance ◽  
Interconnection Networks ◽  
Interconnection Network ◽  
Network Reliability ◽  
Destination Node ◽  
Input Output ◽  
Switching Element ◽  
Node Pair ◽  
Multiple Processors ◽  
Output Stages

Background: VLSI technology advancements have resulted the requirements of high computational power, which can be achieved by implementing multiple processors in parallel. These multiple processors have to communicate with their memory modules by using Interconnection Networks (IN). Multistage Interconnection networks (MIN) are used as IN, as they provide efficient computing with low cost. Objective: the objective of the study is to introduce new reliable Gamma MIN named as a Modified Gamma Interconnection Network (MGIN), which provide reliability and fault-tolerance with less number of stages of Switching element only. Method: Switching Element (SE) of bigger size i.e. 2×3/3×2 has been employed at input/output stages inspite of 1×3/3×1 sized SE at input/output stages with reduction in one intermidiate stage. Fault tolerance has been introduced in the form of disjoint paths formed between each source-destnation node pair. Hence reliability has been improved. Results: Terminal, Broadcast and Network Reliability has been evaluated by using Reliability Block Diagrams for each source-destination node pair. The results have been shown, which depicts the higher reliability values for newly proposed network. The cost analysis shows that new MGIN is a cheaper network than other Gamma variants. Conclusion: MGIN has better reliability and Fault-tolerance than priviously proposed Gamma MIN.

scholarly journals Message Broadcasting via a New Fault Tolerant Irregular Advance Omega Network in Faulty and Nonfaulty Network Environments

2013 ◽  
Vol 2013 ◽  
pp. 1-16 ◽  
Author(s):  
Ved Prakash Bhardwaj ◽  
Nitin
Keyword(s):  
Fault Tolerant ◽  
Interconnection Network ◽  
High Reliability ◽  
Low Cost ◽  
Routing Algorithm ◽  
Multiple Faults ◽  
Message Broadcasting ◽  
Double Switch ◽  
Better Than

Interconnection Network (IN) is a key element for all parallel processing applications. Multistage Interconnection Network (MIN) is an efficient IN for these applications, as it has the quality of excellent performance at low cost with high reliability. MINs are effective medium for message broadcasting. Doing the same task in faulty situations is a critical challenge. In this paper, we have presented a new Fault Tolerant Interconnection Network named as Irregular Advance Omega Network (IAON); also we have presented its routing algorithm. IAON is the modified form of Advance Omega Network. The proposed MIN can endure multiple faults and provides a suitable path between every source to every destination. We have examined the fault tolerance capacity of IAON and compared its performance with other existing MINs. In order to check the performance of proposed MIN, message broadcasting was performed in three conditions as follows: (1) when network was fault free; (2) when network was Single Switch Faulty in every stage; (3) when network was Double Switch Faulty in every stage. Results showed that IAON performed better than the earlier proposed MINs.

Sign in / Sign up

Export Citation Format

Share Document