Maximilian Drees
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 Ω(log log n)-late adversary which only has access to topological information that is at least Ω(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.
- I. Abraham, B. Awerbuch, Y. Azar, Y. Bartal, D. Malkhi, and E. Pavlov. A generic scheme for building overlay networks in adversarial scenarios. In Proc. of IPDPS, page 40, 2003. Google Scholar
Digital Library
- J. Aspnes and U. Wieder. The expansion and mixing time of skip graphs with applications. Distributed Computing, 21(6):385--393, 2009.Google ScholarDigital Library
- J. Augustine, G. Pandurangan, P. Robinson, S. Roche, and E. Upfal. Enabling robust and efficient distributed computation in dynamic peer-to-peer networks. In Proc. of FOCS, pages 350--369, 2015. Google ScholarDigital Library
- B. Awerbuch and C. Scheideler. A denial-of-service resistant DHT. In Proc. of DISC, pages 33--47, 2007. Google ScholarDigital Library
- B. Awerbuch and C. Scheideler. Towards scalable and robust overlay networks. In Proc. of IPTPS, 2007.Google Scholar
- A. Berns, S. Ghosh, and S. V. Pemmaraju. Building self-stabilizing overlay networks with the transitive closure framework. TCS, 512, 2013. Google ScholarDigital Library
- C. Cooper, M. Dyer, and A. J. Handley. The flip markov chain and a randomising p2p protocol. In Proc. of PODC, pages 141--150, 2009. Google ScholarDigital Library
- R. Dingledine, N. Mathewson, and P. Syverson. Tor: the second-generation onion router. In Proc. SSYM, 2004. Google ScholarDigital Library
- J. R. Douceur. The sybil attack. In Proc. of IPTPS, pages 251--260, 2002. Google ScholarDigital Library
- M. Eikel and C. Scheideler. IRIS: a robust information system against insider dos-attacks. In Proc. of SPAA, pages 119--129, 2013. Google ScholarDigital Library
- M. Eikel, C. Scheideler, and A. Setzer. RoBuSt: A crash-failure-resistant distributed storage system. In Proc. of OPODIS, pages 107--122, 2014.Google ScholarCross Ref
- T. Feder, A. Guetz, M. Mihail, and A. Saberi. A local switch markov chain on given degree graphs with application in connectivity of peer-to-peer networks. In Proc. of FOCS, pages 69--76, 2006. Google ScholarDigital Library
- J. Feigenbaum, A. Johnson, and P. Syverson. Preventing active timing attacks in low-latency anonymous communication. In Prof. of PETS, pages 166--183, 2010. Google ScholarDigital Library
- D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, and T. Strothmann. On stabilizing departures in overlay networks. In Proc. of SSS, 2014.Google ScholarCross Ref
- J. Friedman. A Proof of Alon's Second Eigenvalue Conjecture and Related Problems, volume 195 of Memoirs of the AMS. 2008.Google Scholar
- T. P. Hayes, J. Saia, and A. Trehan. The forgiving graph: a distributed data structure for low stretch under adversarial attack. In Proc. of PODC, 2009. Google ScholarDigital Library
- R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Taubig. A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In Proc. of PODC, pages 131--140, 2009. Google ScholarDigital Library
- T. Jacobs and G. Pandurangan. Stochastic analysis of a churn-tolerant structured peer-to-peer scheme. Peer-to-Peer Networking and Applications, 6(1), 2013.Google Scholar
- J. JaJa. An Introduction to Parallel Algorithms. Addison Wesley, 1992. Google ScholarDigital Library
- A. Keromytis, V. Misra, and D. Rubenstein. SOS: Secure Overlay Services. In Proc. of the ACM SIGCOMM, pages 61--72, 2002. Google ScholarDigital Library
- F. Kuhn, S. Schmid, and R. Wattenhofer. A self-repairing peer-to-peer system resilient to dynamic adversarial churn. In Proc. of IPTPS, 2005. Google ScholarDigital Library
- C. Law and K.-Y. Siu. Distributed construction of random expander networks. In Proc. of INFOCOM, volume 3, pages 2133--2143 vol.3, March 2003.Google ScholarCross Ref
- L. Lovasz. Random walks on graphs: A survey, 1993.Google Scholar
- P. Mahlmann and C. Schindelhauer. Distributed random digraph transformations for peer-to-peer networks. In Proc. of SPAA, pages 308--317, 2006. Google ScholarDigital Library
- D. Nanongkai, A. D. Sarma, and G. Pandurangan. A tight unconditional lower bound on distributed randomwalk computation. In Proc. of PODC, 2011. Google ScholarDigital Library
- M. Naor and U. Wieder. Novel architectures for P2P applications: the continuous-discrete approach. In Proc. of SPAA, pages 50--59, 2003. Google ScholarDigital Library
- G. Pandurangan, P. Robinson, and A. Trehan. Dex: Self-healing expanders. In Proc. of IPDPS, 2014. Google ScholarDigital Library
- A. Ranade. How to emulate shared memory. Journal of Computer and System Sciences, 42(3):307--326, 1991. Google ScholarDigital Library
- J. Saia and A. Trehan. Picking up the pieces: Self-healing in reconfigurable networks. In Proc. of IPDPS, pages 1--12, 2008.Google ScholarCross Ref
- A. D. Sarma, D. Nanongkai, and G. Pandurangan. Fast distributed random walks. In Proc. of PODC, 2009. Google ScholarDigital Library
- A. D. Sarma, D. Nanongkai, G. Pandurangan, and P. Tetali. Distributed random walks. Journal of the ACM, 60:2:1--2:31, 2013. Google ScholarDigital Library
- A. Singh, T. Ngan, P. Druschel, and D. S. Wallach. Eclipse attacks on overlay networks: Threats and defenses. In Proc. of the INFOCOM, 2006.Google ScholarCross Ref
- K. Suto, H. Nishiyama, N. Kato, T. Nakachi, T. Fujii, and A. Takahara. THUP: A P2P network robust to churn and DoS attack based on bimodal degree distribution. IEEE Journal on Selected Areas of Communication, 31(9):247--256, 2013.Google ScholarCross Ref
Index Terms
- Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
Recommendations
Trustworthiness of Acquaintances in Peer-to-Peer(P2P) Overlay Networks
CISIS '10: Proceedings of the 2010 International Conference on Complex, Intelligent and Software Intensive SystemsSystems using peer-to-peer (P2P) overlay networks are getting a central position in information systems. P2P systems are in nature fully distributed, with no centralized coordinator and each peer is autonomous. Each peer has to obtain information on ...
Understanding churn in peer-to-peer networks
IMC '06: Proceedings of the 6th ACM SIGCOMM conference on Internet measurementThe dynamics of peer participation, or churn, are an inherent property of Peer-to-Peer (P2P) systems and critical for design and evaluation. Accurately characterizing churn requires precise and unbiased information about the arrival and departure of ...
Evaluation of hierarchical DHTs to mitigate churn effects in mobile networks
This research reviews recent works on flat DHTs under high churn.This research evaluates a flat DHT and a hierarchical DHT with or without churn.This research assesses the performance of two HDHTs with or without churn. Existing flat peer-to-peer (P2P) ...
Comments