Analysis and Improvement of Kademlia's Looking up Performance
Weihai Li · Journal of China Academy of Electronics and Information Technology · 2008
In order to solve the problem of waiting more time than web in the process of search,we put forward a proposal that notices other peers in a range when log out and share the dead nodes found in the look up process with the entry provider,used to update the route tables.In this way,the dead nodes can be accessed in a lower possibility so that the looking up process can be shorter.We ensure the average looking up jumps through simulation so as to find out the range of peers who should be noticed.We also analyze the delay of looking up before and after optimizing to prove the validity of the paper.