Self-adaptive Algorithm in Data Distributed Management

2008 ◽  
Vol 28 (12) ◽  
pp. 128-132 ◽  
Author(s):  
Zhi-wu DOU ◽  
Hong-wei LI
Author(s):  
Patrick Juvet Gnetchejo ◽  
Salomé Ndjakomo Essiane ◽  
Abdouramani Dadjé ◽  
Pierre Ele ◽  
Daniel Eutyche Mbadjoun Wapet ◽  
...  

2002 ◽  
Vol 35 (8) ◽  
pp. 1771-1784 ◽  
Author(s):  
B. Smolka ◽  
K.N. Plataniotis ◽  
A. Chydzinski ◽  
M. Szczepanski ◽  
A.N. Venetsanopoulos ◽  
...  

2011 ◽  
Vol 255-260 ◽  
pp. 2121-2125
Author(s):  
Qiang Xu ◽  
Le Chang Sun ◽  
Min Zhang ◽  
Ting Zhao

Churn is a great challenge for the development and deployment of Distributed Hash Table networks, but current churn treatments ignore the effect of adapting the size of routing table flexibly to handle churn. In this paper, we research the routing table self-adaptive mechanism for Kademlia. Based on quantifying the influence ofK, the parameter representing the size of ak-bucket, on routing performance, a self-adaptive algorithm of K is proposed. This algorithm adapts K to the variation of churn rate which is estimated by the validity of data in routing table. Simulation results show that it can reduce the lookup latency under churn. Even if the churn rate varies remarkably, the network is flexible enough to provide fine performance.


Sign in / Sign up

Export Citation Format

Share Document