Abstract
Peer-to-peer systems are distinguished from traditional distributed systems in that nodes join and leave the p2p system at high rates, called churn problem. SChord, a p2p system, is illustrated in this paper, which is constructed on Chord system and aims to handle churn. We analyze the past experimental studies on churn of p2p systems and do some theoretical analysis on the probability distribution of node session time. SChord is based on such analysis which can distinguish nodes of long session time from other p2p nodes and exploit these long session nodes with its special routing algorithm. The simulation shows that SChord has achieved better performance of churn handling than Chord.
This research is supported by National Natural Science Foundation of China(grant No.60433040), National Basic Research Program of China(grant No.2002CB312002), ChinaGrid Program of MOE of China and Grand Project of the Science and Technology Commission of Shanghai Municipality(grant No.03dz15027).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical report, UCB/CSD-01-1141, University of California at Berkeley, Computer Science Department (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (2001)
Ratnasamy, S., Francis, P., Handley, M.: A scalable content-addressable network. In: Crowcroft, J., Hofmann, M. (eds.) NGC 2001. LNCS, vol. 2233, p. 14. Springer, Heidelberg (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)
Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Conferencing and Networking (2002)
Chu, J., Labonte, K., Levine, B.N.: Availability and locality measurements of peer-to-peer file systems. In: Proc. of ITCom: Scalability and Traffic Control in IP Networks (2002)
Gummadi, K.P., Dunn, R.J., Saroiu, S., Gribble, S.D., Levy, H.M., Zahorjan, J.: Measurement, modeling, and analysis of a peer-to- peer file-sharing workload. In: Proc. ACM SOSP (2003)
Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the Evolution of Peer-to-Peer Systems. In: ACM Conf. on Principles of Distributed Computing, PODC (2002)
Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: SOSP 2001 (2001)
Gummadi, K.P., Saroiu, S., Gribble, S.D.: King: Estimating latency between arbitrary Internet end hosts. In: Proceedings of the 2002 SIGCOMM Internet Measurement Workshop (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hong, F., Li, M., Yu, J. (2005). SChord: Handling Churn in Chord by Exploiting Node Session Time. In: Zhuge, H., Fox, G.C. (eds) Grid and Cooperative Computing - GCC 2005. GCC 2005. Lecture Notes in Computer Science, vol 3795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590354_110
Download citation
DOI: https://doi.org/10.1007/11590354_110
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30510-1
Online ISBN: 978-3-540-32277-1
eBook Packages: Computer ScienceComputer Science (R0)