Fault Tolerance Of Interconnection Networks Research Articles

The Conditional Connectivity of (<i>n,k</i>)-Star Graph

Conditional connectivity has been proposed as an important parameter to estimate the fault tolerance of interconnection networks. In this paper, we consider the conditional connectivity of (n, k)-star graph. An (n, k)-star graph with dimension n (n ≥ 4) and order k can be partitioned into n subgraphs,. By utilizing this property, we give and proof the minimal cut-set and the minimal conditional cut-set of S n,k. We hence obtain that the conditional connectivity of (n, k)-star graph S n,k is n+k−3.

An analysis of edge fault tolerance in recursively decomposable regular networks

Fault tolerance of interconnection networks is one of the major considerations in evaluating the reliability of large scale multiprocessor systems. In the paper, the reliability of a family of regular networks with respect to edge failures is investigated using four different fault tolerance measures. Two probabilistic measures, resilience and restricted resilience, are developed, used to evaluate disconnection likelihoods using two different failure models, and compared with corresponding deterministic measures. The network topologies chosen for the present study all have the recursive decomposition property, where larger networks can be decomposed into copies of smaller networks of the same topology. This family of graphs includes the k-ary n-cube, star and cube connected cycle graphs, which have optimal deterministic connectivities. The probabilistic fault tolerance measures, however, are found to depend on topological properties such as network size and degree. >

Fault tolerance analysis of the class of rearrangeable interconnection networks

The issue of the fault tolerance of interconnection networks has received considerable attention since the last decade. The theoretical framework developed by J. P. Shen and J. P. Hays ( IEEE Trans. Comput. C-33, 3 (Mar. 1984), 241–248) and extended by S. Pakzad and S. Lakshmivarahan ( Internat. J. Comput. Syst. Sci. Engrg. 3, 2 (April 1988), 91–99) can be used as a guideline to analyze the fault tolerance behavior of the interconnection networks in a multicomputer environment. This paper analyzes the fault tolerance characteristics of a range of rearrangeable β-networks based on the concepts and the framework developed by S. Pakzad and S. Lakshmivarahan (cited earlier). These rearrangeable β-networks include the Benes network, the Waksman network, the Joel network, and the serial network. In addition, this paper presents a comparative analysis of the aforementioned networks according to their hardware cost, performance, and degree of fault tolerance.