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.
Chapter PDF
Similar content being viewed by others
References
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: ACM SIGCOMM (2001)
Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: a fault-tolerant wide-area application infrastructure. Computer Communication Review 32(1), 81 (2002)
Gupta, I., Birman, K.P., Linga, P., Demers, A.J., van Renesse, R.: Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)
Maymounkov, P., Mazieres, D.: Kademlia: A peerto -peer information system based on the xor metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 53. Springer, Heidelberg (2002)
Kaashoek, M.F., Karger, R.: Koorde: A simple degreeoptpimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)
Liu, Z., Chen, G., Yuan, C., Lu, S., Xu, C.: Fault Resilience of Structured P2P Systems. In: Zhou, X., Su, S., Papazoglou, M.P., Orlowska, M.E., Jeffery, K. (eds.) WISE 2004. LNCS, vol. 3306, pp. 736–741. Springer, Heidelberg (2004)
Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the Evolution of Peer-to-Peer Networks. In: ACM PODC (2002)
Fiat, A., Saia, J.: Censorship Resistant Peer-to-Peer Content Addressable Networks. In: ACM/SIAM Symposium on Discrete Algorithms (2002)
Saia, J., Fiat, A., Gribble, S., Karlin, A.R., Saroiu, S.: Dynamically Fault-Tolerant Content Addressable Networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 270. Springer, Heidelberg (2002)
Aspnes, J., Diamadi, Z., Shah, G.: Fault-Tolerant Routing in Peer-to-Peer Systems. In: ACM PODC (2002)
Gummadi, K.P., Gummadi, R., Gribble, S.D., Ratnasamy, S., Shenker, S., Stoica, I.: The Impact of DHT Routing Geometry on Resilience and Proximity. In: ACM SIGCOMM (2003)
Li, J., Stribling, J., Gil, T., Morris, R., Kaashoek, F.: Comparing the performance of distributed hash tables under churn. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 87–99. Springer, Heidelberg (2005)
Lam, S.S., Liu, H.: Failure Recovery for Structured P2P Networks: Protocol Design and Performance Evaluation. In: ACM SIGMETRICS/Performance 2004 (2004)
Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience. In: ACM SIGCOMM (2003)
Garcia-Molina, H.: Elections in a Distributed Computing System. IEEE Transactions on Computers C-31(1), 48–59 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, Z., Yuan, R., Li, Z., Li, H., Chen, G. (2006). Survive Under High Churn in Structured P2P Systems: Evaluation and Strategy. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2006. ICCS 2006. Lecture Notes in Computer Science, vol 3994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758549_58
Download citation
DOI: https://doi.org/10.1007/11758549_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34385-1
Online ISBN: 978-3-540-34386-8
eBook Packages: Computer ScienceComputer Science (R0)