R5N: Randomized recursive routing for restricted-route networks

This paper describes a new secure DHT routing algorithm for open, decentralized P2P networks operating in a restricted-route environment with malicious participants. We have implemented our routing algorithm and have evaluated its performance under various topologies and in the presence of malicious peers. For small-world topologies, our algorithm provides significantly better performance when compared to existing methods.

[1]  V. Climenhaga.  Markov chains and mixing times , 2013 .

[2]  Daniel Stutzbach,et al.  Understanding churn in peer-to-peer networks , 2006, IMC '06.

[3]  Christian Grothoff,et al.  Beyond Simulation: Large-Scale Distributed Emulation of P2P Protocols , 2011, CSET.

[4]  Matteo Dell Amico.  A Measurement of Mixing Time in Social Networks , 2009 .

[5]  Gonzalo Camarillo,et al.  Evaluation of DHTs from the viewpoint of interpersonal communications , 2007, MUM.

[6]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[7]  Nathan S. Evans.  Methods for secure decentralized routing in open networks , 2011 .

[8]  Chen Avin,et al.  On the cover time and mixing time of random geometric graphs , 2007, Theor. Comput. Sci..

[9]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[10]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[11]  Mika Ylianttila,et al.  Performance evaluation of a Kademlia-based communication-oriented P2P system under churn , 2010, Comput. Networks.

[12]  Oskar Sandberg,et al.  Distributed Routing in Small-World Networks , 2006, ALENEX.

[13]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[14]  Stefan Schmid,et al.  Poisoning the Kad Network , 2010, ICDCN.

[15]  Christian Grothoff,et al.  Routing in the Dark: Pitch Black , 2007, Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007).

[16]  Michael Kaminsky,et al.  SybilGuard: defending against sybil attacks via social networks , 2006, SIGCOMM.

[17]  Taoufik En-Najjary,et al.  Exploiting KAD: possible uses and misuses , 2007, CCRV.

[18]  Taoufik En-Najjary,et al.  A global view of kad , 2007, IMC '07.

[19]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

[20]  Robert Tappan Morris,et al.  Comparing the Performance of Distributed Hash Tables Under Churn , 2004, IPTPS.