Authors: Alexander Betts; Lu Liu; Zhiyuan Li; Nick Antonopoulos
Addresses: School of Computing and Mathematics, University of Derby, Derby, England, UK ' School of Computing and Mathematics, University of Derby, Derby, England, UK ' School of Computing Science and Communication Engineering, Jiangsu University, Zhenjiang Jiangsu, 212013, China ' School of Computing and Mathematics, University of Derby, Derby, Derbyshire, DE22 1GB, Derby, England, UK
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; DHT; distributed hash table; P2P search algorithms; simulation.
International Journal of Embedded Systems, 2014 Vol.6 No.2/3, pp.250 - 256
Available online: 22 Jul 2014 *Full-text access for editors Access for subscribers Purchase this article Comment on this article