中文

Journal of Applied Sciences ›› 2011, Vol. 29 ›› Issue (1): 66-72.doi: 10.3969/j.issn.0255-8297.2011.01.012

• Computer Science and Applications • Previous Articles     Next Articles

Routing Table Adaptation Mechanism for Kademlia Protocol

XU Qiang1, SUN Le-chang1, ZHANG Min2, LIU Hai-tao3   

  1. 1. Department of Network Engineering, Electronic Engineering Institute of PLA, Hefei 230037, China
    2. Department of Information Engineering, Electronic Engineering Institute of PLA, Hefei 230037, China
    3. Air Force Electronic Technology Research Institute of PLA, Beijing 100195, China
  • Received:2010-09-10 Revised:2010-12-20 Online:2011-01-26 Published:2011-01-25

PDF

2000

Cited

2

Abstract:

To improve performance of distribute Hash table (DHT) networks under churn, we study an adaptive mechanism of the routing table for Kademlia protocol. Based on a quantitative analysis, we propose an algorithm for the K value to adjust the routing table size to adapt to the churn rate. The churn rate is estimated from the available data in the routing table. Simulations show that the proposed algorithm can significantly reduce lookup latency under churn and raise the network’s crash point by nearly 10%. Even when the churn rate fluctuates severely, the network still has a satisfactory performance.

Key words:  peer-to-peer network, distributed Hash table(DHT), churn, routing table, adaptive adjustment

CLC Number: