在扰动状态下Kademlia协议搜索过程性能分析及优化  

Analysis and Improvement of Kademlia's Looking up Performance

作　　者：张铮[1] 侯宾[1] 吕玉琴[1] 刘刚[1] 李巍海[1] 

机构地区：[1]北京邮电大学电子工程学院,北京100876

出　　处：《中国电子科学研究院学报》2008年第6期604-607,共4页Journal of China Academy of Electronics and Information Technology

摘　　要：在P2P应用中,通过Kademlia搜索资源往往需要比web搜索耗费更长时间。为了解决该问题,提出了采用退出时主动通知附近节点与共享搜索中发现的失效节点的方法,通过确定查找平均跳数,来确定通知节点范围。这种方法能够及时更新路由表,减少对失效节点的访问,从而缩短搜索时间。经软件仿真可知,改进后的方案在不明显提高网络带宽占用率的前提下,提高了网络搜索的性能。In order to solve the problem of waiting more time than web in the process of search, we put forward a proposal that notices other peers in a range when log out and share the dead nodes found in the look up process with the entry provider, used to update the route tables. In this way, the dead nodes can be accessed in a lower possibility so that the looking up process can be shorter. We ensure the average looking up jumps through simulation so as to find out the range of peers who should be noticed. We also analyze the delay of looking up before and after optimizing to prove the validity of the paper.

关 键 词：KADEMLIA协议 扰动 节点搜索 性能优化 

分 类 号：TP302.7[自动化与计算机技术—计算机系统结构]