Fault tolerant networks with small degree
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
ACM Transactions on Information and System Security (TISSEC)
Fault-Tolerant Meshes with Small Degree
IEEE Transactions on Computers
Survivable Networks with Bounded Delay: The Edge Failure Case
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Networks with Small Stretch Number
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
(k, +)-Distance-Hereditary Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Optimal fault-tolerant linear arrays
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
(k, +)-distance-hereditary graphs
Journal of Discrete Algorithms
Immunet: A Cheap and Robust Fault-Tolerant Packet Routing Mechanism
Proceedings of the 31st annual international symposium on Computer architecture
Discrete Applied Mathematics - Special issue: Max-algebra
Fault-tolerance and reconfiguration of circulant graphs and hypercubes
Proceedings of the 2008 Spring simulation multiconference
Applying fault-tolerant solutions of circulant graphs to multidimensional meshes
Computers & Mathematics with Applications
Discrete Applied Mathematics
| Hi-index | 0.02 |
This paper presents constructions for fault-tolerant, two-dimensional mesh architectures. The constructions are designed to tolerate $k$ faults while maintaining a healthy n by n mesh as a subgraph. They utilize several novel techniques for obtaining trade-offs between the number of spare nodes and the degree of the fault-tolerant network.We consider both worst-case and random fault distributions. In terms of worst-case faults, we give a construction that has constant degree and O(k3) spare nodes. This is the first construction known in which the degree is constant and the number of spare nodes is independent of n. In terms of random faults, we present several new degree-6 and degree-8 constructions and show (both analytically and through simulations) that these constructions can tolerate large numbers of randomly placed faults.