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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Hong, F., Li, M., & Yu, J. (2005). SChord: Handling churn in Chord by exploiting node session time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3795 LNCS, pp. 919–929). https://doi.org/10.1007/11590354_110
Mendeley helps you to discover research relevant for your work.