对等网络系统和传统分布式网络系统的主要区别在于其组成结点通常频繁的加入和退出对等网络,称为对等网络的“扰动”问题.本文对对等网络的经典覆盖网Chord做了相应改进,以提高Chord处理扰动问题的性能.这种改进后的对等网络覆盖网称为SChord.在分析对等网络结点在线时间的概率分布的基础上。SChord提出了区分在线时间长的结点的方案,并使用了改进的路南算法来利用这些在线时间长的结点.模拟实验证明了和Chord相比较,SChord在处理扰动方面表现出更好的性能.
Peer-to-peer systems are distinguished from traditional distributed systems in that nodes join and leave the P2P system at high rates, called chum problem. The past experimental study on chum of P2P systems has been analyzed and some theoretical analysis has been discussed on the probability distribution of node session time. SChord is a peer-to-peer system based on such analysis to handle chum. SChord is constructed on Chord 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 to handle chum than Chord.