Explicit construction of linear sized tolerant networks
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Robust algorithms for packet routing in a mesh
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Fast computation using faulty hypercubes
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On Designing and Reconfiguring k-Fault-Tolerant Tree Architectures
IEEE Transactions on Computers
Coding theory, hypercube embeddings, and fault tolerance
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Robust bounded-degree networks with small diameters
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Fault-tolerant meshes with small degree
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Multi-scale self-simulation: a technique for reconfiguring arrays with faults
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the fault tolerance of the butterfly
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Node-covering, Error-correcting Codes and Multiprocessors with Very High Average Fault Tolerance
IEEE Transactions on Computers
Sparse networks tolerating random faults
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
| Hi-index | 0.00 |
Suppose each node and each edge of a network is independently faulty with probability at most p and q respectively, where 0 p, q d ≥ 2, we construct a network with O(N) nodes and with degree O(log log N) such that, after removing all the faulty nodes and edges, it still contains the N-node d-dimensional N1/d × … × N1/d torus, and hence the mesh of the same size, with probability 1–N–&OHgr;(loglog N). This is derived as a consequence of a simple constant-degree construction which tolerates random faults where the failure probability of each node is O(log–3d). We also give a simple constant-degree construction with O(N) nodes that tolerates O(N(1–2-d)/d worst case faults.