article · International Journal of Embedded Systems · 2014
A critical comparative evaluation on DHT-based peer-to-peer search algorithms
Alexander Betts, Lu Liu, Zhiyuan Li, Nick Antonopoulos
Cited by 4Open access
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.
Cite this paper
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. https://doi.org/10.1504/ijes.2014.063823
Betts, Alexander, et al. “A critical comparative evaluation on DHT-based peer-to-peer search algorithms.” International Journal of Embedded Systems, vol. 6, no. 2/3, 2014, p. 250, https://doi.org/10.1504/ijes.2014.063823.
Betts, Alexander, Lu Liu, Zhiyuan Li, and Nick Antonopoulos. 2014. “A critical comparative evaluation on DHT-based peer-to-peer search algorithms.” International Journal of Embedded Systems 6 (2/3): 250. https://doi.org/10.1504/ijes.2014.063823.
Betts, A. et al. (2014) ‘A critical comparative evaluation on DHT-based peer-to-peer search algorithms’, International Journal of Embedded Systems, 6(2/3), p. 250. Available at: https://doi.org/10.1504/ijes.2014.063823.
@article{betts2014critical,
title = {{A critical comparative evaluation on DHT-based peer-to-peer search algorithms}},
author = {Betts, Alexander and Liu, Lu and Li, Zhiyuan and Antonopoulos, Nick},
journal = {International Journal of Embedded Systems},
volume = {6},
number = {2/3},
pages = {250},
year = {2014},
doi = {10.1504/ijes.2014.063823}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Comparative Study of can, Pastry, Kademlia and Chord DHTS
Kabre Laciné, Telesphore Tiendrebeogo · International Journal of Peer to Peer Networks · 2021
Cited by 2Open access
Pie: scalable routing in peer-to-peer networks
Peter Lichodzijewski, Leigh Wetmore, Nur Zincir-Heywood · Conference proceedings - Canadian Conference on Electrical and Computer Engineering · 2004
Cited by 0
A review of recent advancement in Kademlia and Chord algorithm
Mohammad Asyraff Mohamad Ariff, Suraya Mohamad, Ahmad Roshidi Amran · AIP conference proceedings · 2019
Cited by 2
Survey of DHT search algorithm in peer-to-peer network
Yanli Du · Jisuanji yingyong yanjiu · 2008
Cited by 2
Peer-to-Peer Single Hop Distributed Hash Tables
Luiz R. Monnerat, Claudio Luis Amorim · Globecom · 2009
Cited by 19
A performance comparison of Chord and Kademlia DHTs in high churn scenarios
Adán G. Medrano-Chávez, Elizabeth Pérez-Cortés, Miguel López-Guerrero · Peer-to-Peer Networking and Applications · 2014
Cited by 12
A survey of DHT solutions in fixed and mobile networks
Sarra Cherbal, Abdellah Boukerram, Abdelhak Boubetra · International Journal of Communication Networks and Distributed Systems · 2016
Cited by 10