KAD is the largest DHT system with several million simultaneous users. The dynamics of peer participation which is called churn affects the performance of lookup operations in P2P systems, since some individual peers in the routing tables might be missing or stale. In this paper, we performed a simple way to improve lookup performance in KAD, by taking highly available contacts as lookup entries instead of stale ones. We track highly available peers in KAD by a special designed crawler. When a stale contact is encountered in the lookup process, the closest XOR-distance highly available peer of the target will be found to replace the stale contact. The measurement study, compared with the normal lookup process, shows that it is much effective.
[1]
David Mazières,et al.
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
,
2002,
IPTPS.
[2]
Taoufik En-Najjary,et al.
Long Term Study of Peer Behavior in the kad DHT
,
2009,
IEEE/ACM Transactions on Networking.
[3]
Zhoujun Li,et al.
ID repetition in Kad
,
2009,
2009 IEEE Ninth International Conference on Peer-to-Peer Computing.
[4]
John Kubiatowicz,et al.
Handling churn in a DHT
,
2004
.
[5]
Moritz Steiner,et al.
Faster Content Access in KAD
,
2008,
2008 Eighth International Conference on Peer-to-Peer Computing.