Faster Content Access in KAD

  • Steiner M
  • Carra D
  • Biersack E
  • 7


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


Many different distributed hash tables (DHTs) have been designed, but only few have been successfully deployed. The implementation of a DHT needs to deal with practical aspects (e.g. related to churn, or to the delay) that are often only marginally considered in the design. In this paper, we analyze in detail the content retrieval process in KAD, the implementation of the DHT Kademlia that is part of several popular peer-to-peer clients. In particular, we present a simple model to evaluate the impact of different design parameters on the overall lookup latency. We then perform extensive measurements on the lookup performance using an instrumented client. From the analysis of the results, we propose an improved scheme that is able to significantly decrease the overall lookup latency without increasing the overhead.

Author-supplied keywords

  • Content based retrieval
  • Current measurement
  • Delay
  • Instruments
  • Kademlia
  • Peer to peer computing
  • Performance analysis
  • Performance evaluation
  • Publishing
  • Routing
  • content management
  • content retrieval process
  • cryptography
  • distributed hash table
  • information retrieval
  • measurement
  • overall lookup latency
  • p2p
  • peer-to-peer client
  • peer-to-peer computing
  • performance

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • M Steiner

  • D Carra

  • E W Biersack

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free