降低DHT-based P2P系统的维护开销及其仿真  

Effectively Reducing Maintenance Cost of DHT-based P2P System and Computer Simulation

作　　者：任小金[1,2] 汪国安[3] 古志民[1] 高志伟[1] 

机构地区：[1]北京理工大学计算机科学技术学院 [2]河南大学网络信息中心,河南开封475001 [3]河南大学网络信息中心

出　　处：《系统仿真学报》2008年第12期3305-3308,3313,共5页Journal of System Simulation

基　　金：北京理工大学基础研究基金资助项目(0301F18)

摘　　要：在P2P系统内每秒钟或许有成百上千个节点加入或离开系统,这种高动态性必然极大的增加DHT-based系统的维护开销,导致这种开销的主要原因是节点构建其路由信息时产生的开销。因此为了降低节点构建路由信息时带来的开销,提出了Chord系统的一种新的加入算法—JoinBP。JoinBP通过利用查询路径上节点的指针表信息来构建加入节点的指针信息,减少了节点在创建指针信息时需要的查询跳数和查询延迟,从而减少了构建finger时产生的开销。理论和模拟试验结果表明,JoinBP很大程度减少了系统的维护开销,同时提高了系统的查询性能。P2P system may consist of hundreds of join and leave events per second. The highly dynamic characteristic must increase the maintenance overhead greatly for DHT-based P2P system. The main reason of causing the cost is the lookup cost that nodes build their routing information. So to decrease the cost, a new join algorithm is designed, named JoinBP. JoinBP builds the fingers of node by the help of fingers information of nodes in the lookup path. The new algorithm decreases effectively the lookup hops and lookup latency of building fingers. Theory analysis and simulation show that JoinBP decreases greatly the maintenance cost and improves the lookup performance.

关 键 词：P2P CHORD 维护开销 仿真 

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