|
|
|
| Research on the Heuristic Bootstrapping Mechanism for Kademlia |
| Xu Qiang① Sun Le-chang① Liu Hai-tao② |
①(Network Engineering Department, Electronic Engineering Institute of PLA, Hefei 230037, China)
②(Air Force Electronic Technology Research Institute of PLA, Beijing 100195, China) |
|
|
|
|
Abstract 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.
|
|
Received: 06 April 2010
|
|
|
|
Corresponding Authors:
Xu Qiang
E-mail: yfnm126@126.com
|
|
|
|
|
|
|
2011, Vol. 33 
