摘要： Chord系统在节点频繁加入或离开网络时，会造成大量的开销。为了降低这种加入开销，该文提出了一种新的加入算法——SPJoin，减少了总的加入开销，使结点能更快速地加入网络。理论分析表明，SPJoin在构造加入节点的每一个finger时，需要通过查询获得finger项的概率小于1/2logN，最坏情况下，加入节点构造finger table的开销为O(logNloglogN)跳。模拟实验结果表明，SPJoin在很大程度上减少了加入开销，基本不影响网络的查询性能。
关键词:
P2P,
Chord,
后继,
前驱
Abstract: Frequently join or leave of node in Chord system must increase the maintenance overhead. To decrease the overhead, a new join algorithm, namely SPJoin, is proposed. SPJoin reduces the total join overheads. Theory analysis shows the probability of lookup finger entry is less than 1/2logN when SPJoin constructs each finger entry. In the worst case, the lookup hops that the joining node constructs the finger table is O(logNloglogN). The simulation shows that compared to ChordFingerPNS, SPJoin can decrease the join overheads greatly while slightly affected the lookup performance.
Key words:
P2P,
Chord,
successor,
predecessor
中图分类号:
任小金;古志民. 改进的Chord加入算法[J]. 计算机工程, 2007, 33(17): 123-124,.
REN Xiao-jin; GU Zhi-min. Improved Chord Joining Algorithm[J]. Computer Engineering, 2007, 33(17): 123-124,.