Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Efficient routing for peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Bandwidth-efficient management of DHT routing tables
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Evaluation of DHTs from the viewpoint of interpersonal communications
Proceedings of the 6th international conference on Mobile and ubiquitous multimedia
EpiChord: Parallelizing the Chord lookup algorithm with reactive routing state management
Computer Communications
Performance evaluation of a Kademlia-based communication-oriented P2P system under churn
Computer Networks: The International Journal of Computer and Telecommunications Networking
D1HT: a distributed one hop hash table
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |
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.