Show simple item record

dc.contributor.authorBetts, Alexander
dc.contributor.authorLiu, Lu
dc.contributor.authorLi, Zhiyuan
dc.contributor.authorAntonopoulos, Nikolaos
dc.date.accessioned2016-11-16T19:23:15Z
dc.date.available2016-11-16T19:23:15Z
dc.date.issued2014
dc.identifier.citationBetts, A., Liu, L., Li, Z. and Antonopoulos, N. (2014) ‘A critical comparative evaluation on DHT-based peer-to-peer search algorithms’, Int. J. Embedded Systems, Vol. 6, Nos. 2/3, pp.250–256.en
dc.identifier.issn1741-1068
dc.identifier.doi10.1504/IJES.2014.063823
dc.identifier.urihttp://hdl.handle.net/10545/620885
dc.description.abstractPeer-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.
dc.language.isoenen
dc.publisherInderscience Publishersen
dc.relation.urlhttp://www.inderscience.com/link.php?id=63823en
dc.relation.urlhttp://www.inderscience.com/jhome.php?jcode=ijesen
dc.rightsArchived with thanks to International Journal of Embedded Systemsen
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/en
dc.subjectPeer-to-peer networksen
dc.subjectLookup protocolsen
dc.subjectDistributed scalable algorithmsen
dc.subjectOverlay routingen
dc.titleA critical comparative evaluation on DHT-based peer-to-peer search algorithmsen
dc.typeArticleen
dc.identifier.eissn1741-1076
dc.contributor.departmentUniversity of Derbyen
dc.identifier.journalInternational Journal of Embedded Systemsen
html.description.abstractPeer-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.


This item appears in the following Collection(s)

Show simple item record

Archived with thanks to International Journal of Embedded Systems
Except where otherwise noted, this item's license is described as Archived with thanks to International Journal of Embedded Systems