Title :
New Routing Update Mechanisms of Kademlia
Author :
Hou, Bin ; Liu, Gang ; Li, Weihai ; Zhang, Zheng
Author_Institution :
Sch. of Electron. Eng., Beijing Univ. of Post & Telecommun., Beijing, China
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.
Keywords :
file organisation; peer-to-peer computing; routing protocols; backward updating mechanism; churn state; distributed hash table; k-bucket; kademlia protocol; leaving advertise mechanism; lookup initiator; overlay network; peer-to-peer distributed system; routing lookup process; routing update mechanism; Analytical models; Binary trees; Delay; Fault tolerant systems; Joining processes; Peer to peer computing; Performance analysis; Proposals; Routing protocols; Telecommunication standards;
Conference_Titel :
Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-3692-7
Electronic_ISBN :
978-1-4244-3693-4
DOI :
10.1109/WICOM.2009.5302773
