New routing update mechanisms of kademlia

Authors:
Bin Hou;Gang Liu;Weihai Li;Zheng Zhang
Affiliations:
School of Electronic Engineering, Beijing University of Post & Telecommunication, Beijing, China;School of Electronic Engineering, Beijing University of Post & Telecommunication, Beijing, China;School of Electronic Engineering, Beijing University of Post & Telecommunication, Beijing, China;School of Electronic Engineering, Beijing University of Post & Telecommunication, Beijing, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 2
Cited 0

Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Comparing the performance of distributed hash tables under churn

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Putting forward new routing update mechanisms, improved lookup performance of standard kademlia protocol: each node would advertise others in a range when it is leaving overlay network; and each node should backward notice its routing providers about the failed links founded in its routing lookup process, then lookup initiator and routing providers could update their k-buckets corporately. In the new mechanisms, the dead nodes would be accessed in very low possibility so that the lookup process can be more effective, especially under churn state. Determine arguments of mechanisms and analyze the lookup performance through simulation, prove the validity of the mechanisms.