Research Output
A critical comparative evaluation on DHT-based peer-to-peer search algorithms
  Peer-to-peer networks are becoming increasingly popular as a method of creating highly scalable and robust distributed systems. To address performance issues when scaling traditional unstructured protocols to large network sizes many protocols have been proposed which make use of distributed hash tables to provide a decentralised and robust routing table. This paper investigates the most significant structured distributed hash table (DHT) protocols through a comparative literature review and critical analysis of results from controlled simulations. This paper discovers several key design differences, resulting in pastry performing best in every test. Chord performs worst, mostly attributed to its unidirectional distance metric, while significant generation of maintenance messages hold Kademila back in bandwidth tests.

  • Type:


  • Date:

    22 July 2014

  • Publication Status:


  • Publisher

    Inderscience Publishers

  • DOI:


  • ISSN:


  • Library of Congress:

    QA75 Electronic computers. Computer science

  • Dewey Decimal Classification:

    004 Data processing & computer science

  • Funders:

    Historic Funder (pre-Worktribe)


Betts, A., Liu, L., Li, Z., & Antonopoulos, N. (2014). A critical comparative evaluation on DHT-based peer-to-peer search algorithms. International Journal of Embedded Systems, 6(2/3), 250-256.



Peer-to-peer networks, Lookup protocols, Distributed scalable algorithms, Overlay routing

Monthly Views:

Available Documents