A Heuristic Bootstrapping Mechanism For Kademlia

摘要：

Churn is one of the crucial problems which restrict the development and deployment of DHT networks. In terms of churn treatment, this paper studies the quick start-up bootstrapping mechanism for Kademlia and proposes a heuristic bootstrapping algorithm to overcome the defects of the original. By modifying the way how to populate the routing tables, the heuristic algorithm decreases the messages sent by the joining nodes. Theoretical analysis and simulations show that this algorithm can reduce the cost incurred by node joining and boost the systems capability of recovering from churn.

关键词： P2P:DHT:churn:bootstrapping mechanism:heuristic

作者: Qiang Xu Lechang Sun Nan Shen

作者单位: Dept. of Network Engineering Electronic Engineering Institute Hefei,China Dept. of Graduate Student Electronic Engineering Institute Hefei,China

会议类型: 国际会议

会议名称: The 5th International Conference on Computer Science & Education(第五届国际计算机新技术与教育学术研讨会 ICCSE10)

会议地点: 合肥

会议语种:英文

页码: 1007-1011

在线出版日期: 2010-08-24（万方平台首次上网日期，不代表论文的发表时间）