Reconfiguring a hypercube in the presence of faults
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Explicit construction of linear sized tolerant networks
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Fault tolerance in networks of bounded degree
SIAM Journal on Computing
Robust algorithms for packet routing in a mesh
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Percolation theory and computing with faulty arrays of processors
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks
IEEE Transactions on Computers - Special issue on fault-tolerant computing
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
Tolerating a linear number of faults in networks of bounded degree
Information and Computation
On the fault tolerance of the butterfly
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomized algorithms
Agreement in the presence of faults, on networks of bounded degree
Information Processing Letters
Reconfiguring Arrays with Faults Part I: Worst-Case Faults
SIAM Journal on Computing
On the Fault Tolerance of Some Popular Bounded-Degree Networks
SIAM Journal on Computing
Tight Analyses of Two Local Load Balancing Algorithms
SIAM Journal on Computing
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Stability of load balancing algorithms in dynamic adversarial systems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Universal Routing Strategies for Interconnection Networks
Universal Routing Strategies for Interconnection Networks
Models and Techniques for Communication in Dynamic Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Routing on butterfly networks with random faults
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On the Expansion of the Giant Component in Percolated (n, d,λ) Graphs
Combinatorics, Probability and Computing
Hi-index | 0.00 |
In this paper we study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain so that it still contains a large (i.e. linear-sized) connected component that still has approximately the same expansion as the original fault-free network. For this we apply a pruning technique which culls away parts of the faulty network which have poor expansion. This technique can be applied to both adversarial faults and to random faults. For adversarial faults we prove that for every network with expansion α, a large connected component with basically the same expansion as the original network exists for up to a constant times α • n faults. This result is tight in the sense that every graph G of size n and uniform expansion α (•),i.e. G has an expansion of α (n) and every subgraph G' of size m of G has an expansion of O (α (m)), can be broken into sublinear components with w(α (n) • n) faults.For random faults we observe that the situation is significantly different. In this case the expansion of a graph only gives a very weak bound on its resilience to random faults. Specifically, there are networks of uniform expansion O(≾n) that are resilient against a constant fault probability but there are also networks of uniform expansion Ω(1/log n) that are not resilient against a O(1/log n) fault probability. Thus, a different parameter is needed. For this we introduce the span of a graph which allows us to determine the maximum fault probability in a much better way than the expansion can. We use the span to show the first known results for the effect of random faults on the expansion of d-dimensional meshes.