Scalable onion routing with torsk
Proceedings of the 16th ACM conference on Computer and communications security
Expansion and the cover time of parallel random walks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Improved fault tolerance and secure computation on sparse networks
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Rumor spreading and vertex expansion on regular graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fast byzantine agreement in dynamic networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Storage and search in dynamic peer-to-peer networks
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
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 and still contain a large (i.e., linear-sized) connected component with approximately the same expansion as the original fault-free network. We use a pruning technique that culls away those parts of the faulty network that have poor expansion. The faults may occur at random or be caused by an adversary. Our techniques apply in either case. In the adversarial setting we prove that for every network with expansion $\alpha,$ a large connected component with basically the same expansion as the original network exists for up to a constant times $\alpha \cdot n$ faults. We show this result is tight in the sense that every graph G of size n and uniform expansion $\alpha(\cdot)$ can be broken into components of size o(n) with $\omega(\alpha(n) \cdot n)$ faults. Unlike the adversarial case, the expansion of a graph gives a very weak bound on its resilience to random faults. While it is the case, as before, that there are networks of uniform expansion $\Omega(1/{\rm log}\, n)$ that are not resilient against a fault probability of a constant times $1/{\log}\, n,$ it is also observed that there are networks of uniform expansion $O(1/\sqrt{n})$ that are resilient against a constant fault probability. Thus, we introduce a different parameter, called the span of a graph, which gives us a more precise handle on the maximum fault probability. We use the span to show the first known results for the effect of random faults on the expansion of d-dimensional meshes.