Generalized measures of fault tolerance in n-cube networks

Abstract

In this paper, it is shown that for a given p (1 < p 5 n ) , the n-cube network can tolerate up to p2,-P -1 processor failures and remains connected provided that at most p neighbors of any nonfaulty processor are allowed to fail. This generalizes the result for p = n -1, obtained by Esfahanian [l]. We also show that the n-cube network with n 2 5 remains connected provided that at most two neighbors of any processor are allowed to fail.

A kind of conditional fault tolerance of alternating group graphs

“…Later, Latifi et al. [9] and Oh and Choi [10] determined κ k (Q n ) = (n −k)2 k for 1 k n. In [7], Hu and Yang proved that κ 1 (SG n ) = 2n − 4, where SG n is the n-dimensional star graph. The exact value of κ 2 (SG n ) was shown to be 6(n − 3) for n 4 by Wan and Zhang [11].…”

Packet Routing in Fixed-Connection Networks: A Survey

“…Bounds on the hypercube diameter for a fixed number of faults are provided in [234,307]. Other known results for this model are given in:…”

A kind of conditional fault tolerance of -star graphs

“…Latifi et al [15] and Oh and Choi [17] determined κ k (Q n ) = (n − k)2 k for 1 k n − 2, respectively. In [14], Hu and Yang proved that κ 1 (S n ) = 2n − 4, where S n is the n-dimensional star graph.…”