Enhancing the Flexibility of Kademlia under Churn


Article Preview

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 of K, the parameter representing the size of a k-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.



Advanced Materials Research (Volumes 255-260)

Edited by:

Jingying Zhao




Q. Xu et al., "Enhancing the Flexibility of Kademlia under Churn", Advanced Materials Research, Vols. 255-260, pp. 2121-2125, 2011

Online since:

May 2011




[1] S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling churn in a DHT. In Proc. of the USENIX Annual Technical Conference (2004), USENIX Association Press, p.127−140.

[2] P. Kersch, R. Szabo, L. Cheng, K. Jean, and A. Galis. Stochastic maintenance of overlays in structured P2P systems. Computer Communications, Vol. 31 (2008. 3), p.603−619.

DOI: https://doi.org/10.1016/j.comcom.2007.08.017

[3] Q. F. Huang, Z. T. Li , C. W. Lu, and W. D. Wang. Analyzing the cost of DHT handling churn. Journal of Computer Research and Development, Vol. 45 (2008 Suppl. ), pp.409-414.

[4] J. Y. Li, J. Stribling, R. Morris, M. F. Kaashoek, and T. M. Gill. A performance vs. cost frame for evaluating DHT design tradeoffs under churn. In Proc. of INFOCOM (2005), IEEE Press, pp.225-236.

DOI: https://doi.org/10.1109/infcom.2005.1497894

[5] J. Y. Li, J. Stribling, R. Morris, and M. F. Kaashoek. Bandwidth-efficient management of DHT routing tables. In Proc. of the 2nd Symposium on Networked System Design and Implementation (2005), USENIX Association Press, pp.99-114.

[6] P. Maymounkov, and D. Mazieres. Kademlia: a peer-to-peer information system based on the XOR metric. In Proc. of the International workshop on Peer-to-Peer Systems (2002), Springer-Verlag, pp.53-65.

DOI: https://doi.org/10.1007/3-540-45748-8_5

[7] J Kleinberg. The small-world phenomenon: an algorithm perspective. In Proc. of the 32nd Annual ACM Symposium on Theory of Computing (2000), ACM Press, pp.163-170.

DOI: https://doi.org/10.1145/335305.335325

[8] Y. X. Zhang, D. Yang, and H. K. Zhang. Research on churn problem in P2P network. Journal of Software, Vol. 20 (2009. 5), pp.1362-1379.

[9] D. Wu, Y. Tian, and K. W. Ng. Analytical study on improving DHT lookup performance under churn. In Proc. of the 6th IEEE international conference on Peer-to-Peer Computing (2006), IEEE Press, p.249−258.

DOI: https://doi.org/10.1109/p2p.2006.4

[10] D. Stutzbach, and R. Rejaie. Improving lookup performance over a widely-deployed DHT. In Proc. of the IEEE INFOCOM (2006), IEEE Press, p.1−12.

DOI: https://doi.org/10.1109/infocom.2006.329

[11] The P2PSim Project, http: /pdos. csail. mit. edu/p2psim/. (2010. 5).

[12] The Index of King Data, http: /pdos. csail. mit. edu/p2psim/ kingdata/. (2010. 5).

Fetching data from Crossref.
This may take some time to load.