%0 Journal Article
%T Research on the Heuristic Bootstrapping Mechanism for Kademlia<br>Kademlia中启发式入网机制研究
%A Xu Qiang
%A Sun Le-chang
%A Liu Hai-tao
%A <br>徐强
%A 孙乐昌
%A 刘海涛
%J 电子与信息学报
%D 2011
%I 
%X Churn is one of the main problems restricting the development and deployment of Distributed Hash Table networks. In terms of churn treatment, this paper researches the quick start-up bootstrapping mechanism of Kademlia and proposes a heuristic bootstrapping algorithm to overcome the defects of the original. By changing the way how to populate the routing tables, the heuristic algorithm decreases the messages sent by the joining nodes. Theoretical analysis and simulation result show that this algorithm can reduce the cost incurred by node joining and boost the system’s capability of recovering from churn.
%K Peer-to-Peer network
%K Distributed Hash Table (DHT)
%K Churn
%K Bootstrapping mechanism
%K Heuristic<br>对等网络
%K 分布式哈希表
%K 抖动
%K 入网机制
%K 启发式
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=A3B5828A6F4D8E965E8DCC15C36E7EE0&yid=9377ED8094509821&vid=27746BCEEE58E9DC&iid=0B39A22176CE99FB&sid=4FE459D71E3BF8EB&eid=273ADA1BCEFE8C00&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=10