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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Liu, Z., Yuan, R., Li, Z., Li, H., & Chen, G. (2006). Survive under high churn in structured P2P systems: Evaluation and strategy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3994 LNCS-IV, pp. 404–411). Springer Verlag. https://doi.org/10.1007/11758549_58
Mendeley helps you to discover research relevant for your work.