Iter-Join:一个低开销Chord加入算法  

Iter-Join:A Low Cost Join Algorithm of Chord

作　　者：任小金[1] 于静洋[2] 

机构地区：[1]河南大学网络信息中心,河南开封475001 [2]河南大学计算机与信息工程学院,河南开封475001

出　　处：《河南大学学报（自然科学版）》2008年第3期301-304,312,共5页Journal of Henan University:Natural Science

摘　　要：高动态性是P2P系统的一个重要特性,节点可以在任何时间加入和离开系统,频繁地加入和离开行为必然极大地增长DHT系统的维护开销.为了减少这种开销,设计了一个新的迭代加入算法(Iter-Join).Iter-Join适合高动态环境,通过迭代方式利用节点指针表内的指针信息构建节点的指针表,减少了节点加入时造成的开销,使节点能快速加入网络.理论分析表明,Iter-Join在构建加入节点的每项指针时一跳可以得到的概率大于0.66.模拟实验结果表明,Iter-Join极大地减少了节点的加入开销,同时在一定程度上提高了系统的查询性能.Highly dynamic is one of the most important characteristics of P2P system in nature. Nodes may join in or leave the P2P system at any moment. Frequently joining or leaving must increase the maintenance overhead greatly for DHT system. For reducing the cost we introduce a new join operation for Chord, named Iter-Join that is suitable for highly dynamic environments and can fast join in the system. Iter-Join is iterative. It builds the finger table of node by using fingers information of nodes in the lookup path. Theoretical analysis shows the probability that each finger of the join node can be gained by one hop is greater than 0.66. The simulation shows that her-Join decreases the join overhead greatly and improves the lookup performance .

关 键 词：迭代 递归 CHORD PNS 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]