Survive under high churn in structured P2P systems: evaluation and strategy

Authors:
Zhiyu Liu;Ruifeng Yuan;Zhenhua Li;Hongxing Li;Guihai Chen
Affiliations:
State Key Laboratory of Novel Software Technology, Nanjing University, China;State Key Laboratory of Novel Software Technology, Nanjing University, China;State Key Laboratory of Novel Software Technology, Nanjing University, China;State Key Laboratory of Novel Software Technology, Nanjing University, China;State Key Laboratory of Novel Software Technology, Nanjing University, China
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Year:
2006

Citing 12
Cited 0

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
Tapestry: a fault-tolerant wide-area application infrastructure

ACM SIGCOMM Computer Communication Review
Censorship resistant peer-to-peer content addressable networks

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fault-tolerant routing in peer-to-peer systems

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Analysis of the evolution of peer-to-peer systems

Proceedings of the twenty-first annual symposium on Principles of distributed computing
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
Dynamically Fault-Tolerant Content Addressable Networks

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The impact of DHT routing geometry on resilience and proximity

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Failure recovery for structured P2P networks: protocol design and performance evaluation

Proceedings of the joint international conference on Measurement and modeling of computer systems
Elections in a Distributed Computing System

IEEE Transactions on Computers
Comparing the performance of distributed hash tables under churn

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In Peer to Peer (P2P) systems, peers can join and leave the network whenever they want. Such “freedom” causes unpredictable network environment which leads to the most complex design challenge of a p2p protocol: how to make p2p service available under churn? What is more, where is the extreme of a system’s resistibility to high churn? A careful evaluation of some typical peer-to-peer networks will contribute a lot to choosing, using and designing a certain kind of protocol in special applications. In this paper we analyze the performance of Chord [1], Tapestry [2], Kelips [3], Kademlia [4] and Koorde [5], then find out the crash point [6] of each network based on the simulation experiment. Finally, we propose a novel way to help nodes survive under high churn.