Db_Kad:一种基于网络延迟的Kademlia算法  

Db_Kad:An Improved Kademlia Algorithm Based On Network Latency

作　　者：宋晓慧[1] 张宏莉[1] 张冬艳[1] 周江涛[1] 

机构地区：[1]哈尔滨工业大学计算机网络与信息安全技术研究中心

出　　处：《微计算机信息》2009年第9期107-108,61,共3页Control & Automation

摘　　要：资源定位是影响P2P(peer to peer)系统性能的关键环节,如何充分利用Internet网络运行状态信息,进行Overlay节点查询是目前P2P设计与应用领域的热点问题之一。本文通过在Kad网络资源选择中引入网络延迟参数信息,提出了一种改进的Kad算法:Db_Kad。实验表明,改进算法在收敛速度不变的情况下,平均查询速度提高了8%。Resource location is a key part in P2P （peer to peer） system performance. How to make full use of Internet real time running information to locate nodes in Overlay network has become a hot spot in current P2P design and application areas. In this paper, we introduce network latency information into the existing Kad routing algorithm. Through introducing a network latency parameter, we proposed an improved Kad algorithm： Db_Kad. The experimental results show that the Db_Kad algorithm which keeping the convergence rate unchanged has improved the average query speed by 8 percent.

关 键 词：P2P DHT KADEMLIA 网络延迟 覆盖网络 

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