| Title | Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration |
| Publication Type | Conference Paper |
| Year of Publication | 2016 |
| Authors | Drees, Maximilian, Gmyr, Robert, Scheideler, Christian |
| Conference Name | Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures |
| Publisher | ACM |
| Conference Location | New York, NY, USA |
| ISBN Number | 978-1-4503-4210-0 |
| Keywords | Chained Attacks, churn, DOS-attack, expander, hypercube, overlay network, pubcrawl, random walks, resilience, Scalability |
| Abstract | We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a O(log log n)-late adversary which only has access to topological information that is at least O(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconfiguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems. |
| URL | http://doi.acm.org/10.1145/2935764.2935783 |
| DOI | 10.1145/2935764.2935783 |
| Citation Key | drees_churn-_2016 |
Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration