A critical comparative evaluation on DHT-based peer-to-peer search algorithms
Journal article
Authors | Betts, Alexander, Liu, Lu, Li, Zhiyuan and 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. |
Keywords | Peer-to-peer networks; Lookup protocols; Distributed scalable algorithms; Overlay routing |
Year | 2014 |
Journal | International Journal of Embedded Systems |
Publisher | Inderscience Publishers |
ISSN | 1741-1068 |
1741-1076 | |
Digital Object Identifier (DOI) | https://doi.org/10.1504/IJES.2014.063823 |
Web address (URL) | http://hdl.handle.net/10545/620885 |
http://creativecommons.org/licenses/by-nc-nd/4.0/ | |
hdl:10545/620885 | |
Publication dates | 2014 |
Publication process dates | |
Deposited | 16 Nov 2016, 19:23 |
Rights | Archived with thanks to International Journal of Embedded Systems |
Contributors | University of Derby |
File | File Access Level Open |
File | File Access Level Open |
https://repository.derby.ac.uk/item/943yx/a-critical-comparative-evaluation-on-dht-based-peer-to-peer-search-algorithms
Download files
63
total views0
total downloads3
views this month0
downloads this month