Sciweavers

Share
ISPAN
1999
IEEE

Sparse Networks Tolerating Random Faults

9 years 4 months ago
Sparse Networks Tolerating Random Faults
A network G is called random-fault-tolerant (RFT) network for a network G if G contains a fault-free isomorphic copy of G with high probability even if each processor fails independently with constant probability. This paper proposes a general method to construct an RFT network G for any network G with N processors such that G has O(N) processors. Based on the construction, we also show that if G is a Cayley, de Bruijn, shu e-exchange, or partial k-tree network with N processors and M communication links then we can construct an RFT network for G with O(N) processors and O(M log N) communication links. Cayley networks contain many popular networks such as circulant, hypercube, CCC, wrapped butter y, star, and pancake networks. ? 2003 Elsevier B.V. All rights reserved.
Toshinori Yamada, Shuichi Ueno
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where ISPAN
Authors Toshinori Yamada, Shuichi Ueno
Comments (0)
books