Performance evaluation of EpiChord under high churn

Churn has a great effect on the performance of structured Peer-to-Peer (P2P) overlays -- specifically in mobile environments, where overlays have to deal with frequent join and leave events of nodes. In this paper, we evaluate the performance of EpiChord under high churn. EpiChord is a structured P2P overlay based on Chord, which uses a Distributed Hash Table (DHT) and removes the O(logN)-state-per-node restriction imposed by the majority of other DHT topologies. This is done by using a reactive routing state maintenance strategy that repays network maintenance costs into lookup queries, resulting in a significantly better lookup performance with comparable maintenance costs to traditional multi-hop DHTs. While comparative studies of overlay algorithms for wired networks have been reported, no such evaluation has been carried out of the suitability of the EpiChord overlay for mobile networks. This paper evaluates the performance and efficiency of EpiChord, taking into account the churn conditions as seen in mobile networks. The evaluation is conducted using the OverSim simulation framework. The simulation results suggest that it is feasible for mobile peers to take part in the overlay indicated by the observed results for success ratio and bandwidth consumption. We further show that a large degree of parallelism in the lookups is not substantially improving the performance, rather a parallelism degree of 3 is sufficient to make EpiChord resilient under different varied levels of churn.

[1]  S. Krause,et al.  OverSim: A Flexible Overlay Network Simulation Framework , 2007, 2007 IEEE Global Internet Symposium.

[2]  Ben Y. Zhao,et al.  Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

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

[4]  Mario Kolberg,et al.  Performance Evaluation of Structured Peer-to-Peer Overlays for Use on Mobile Networks , 2013, 2013 Sixth International Conference on Developments in eSystems Engineering.

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

[6]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[7]  Mario Kolberg,et al.  A Markov Model for the EpiChord Peer-to-Peer Overlay in an XCAST enabled Network , 2007, 2007 IEEE International Conference on Communications.

[8]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[9]  Anjali Gupta,et al.  Efficient Routing for Peer-to-Peer Overlays , 2004, NSDI.

[10]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

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

[12]  Mario Kolberg,et al.  An Evaluation of EpiChord in OverSim , 2014, NETCOM 2014.

[13]  Himabindu Pucha,et al.  How to Implement DHTs in Mobile Ad Hoc Networks , 2004 .

[14]  Robert Tappan Morris,et al.  A performance vs. cost framework for evaluating DHT design tradeoffs under churn , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[15]  Mario Kolberg,et al.  Analysis of an Active Maintenance Algorithm for an O(1)-Hop Overlay , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[16]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[17]  Cláudio L. Amorim,et al.  D1HT: a distributed one hop hash table , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

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

[19]  Mario Kolberg,et al.  Overview of Structured Peer-to-Peer Overlay Algorithms , 2010 .

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

[21]  Indranil Gupta,et al.  Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead , 2003, IPTPS.

[22]  Erik D. Demaine,et al.  EpiChord: parallelizing the chord lookup algorithm with reactive routing state management , 2004, Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955).

[23]  Robert Tappan Morris,et al.  Bandwidth-efficient management of DHT routing tables , 2005, NSDI.