A critical comparative evaluation on DHT-based peer-to-peer search algorithms

Betts, Alexander; Liu, Lu; Li, Zhiyuan; Antonopoulos, Nikolaos

Abstract

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.

Citation

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. https://doi.org/10.1504/ijes.2014.063823

• Journal Article Type: Article
• Online Publication Date: Jul 22, 2014
• Publication Date: 2014
• Deposit Date: Feb 12, 2019
• Journal: International Journal of Embedded Systems
• Print ISSN: 2356-5942
• Electronic ISSN: 2382-2562
• Publisher: N&N Global Technology
• Peer Reviewed: Peer Reviewed
• Volume: 6
• Issue: 2/3
• Pages: 250-256
• DOI: https://doi.org/10.1504/ijes.2014.063823
• Keywords: Peer-to-peer networks, Lookup protocols, Distributed scalable algorithms, Overlay routing
• Public URL: http://researchrepository.napier.ac.uk/Output/1557034