You are here

Experimental comparison of Byzantine fault tolerant distributed hash tables

TitleExperimental comparison of Byzantine fault tolerant distributed hash tables
Publication TypeThesis
Year of Publication2014
AuthorsSingh, S
Refereed DesignationNon-Refereed
AdvisorGrothoff, C, Polot, B, Totakura, SHarsha
Academic DepartmentComputer Science
DegreeM.S.
Number of Pages42
Date Published09/2014
UniversitySaarland University
CitySaarbruecken
Thesis TypeMasters
KeywordsDHT, GNUnet, performance analysis, testbed, X-vine
Abstract

Distributed Hash Tables (DHTs) are a key data structure for construction of a peer to
peer systems. They provide an efficient way to distribute the storage and retrieval of
key-data pairs among the participating peers. DHTs should be scalable, robust against
churn and resilient to attacks. X-Vine is a DHT protocol which offers security against
Sybil attacks. All communication among peers is performed over social network links,
with the presumption that a friend can be trusted. This trust can be extended to a
friend of a friend. It uses the tested Chord Ring topology as an overlay, which has been
proven to be scalable and robust.
The aim of the thesis is to experimentally compare two DHTs, R5 N and X-Vine.
GNUnet is a free software secure peer to peer framework, which uses R 5N . In this
thesis, we have presented the implementation of X-Vine on GNUnet, and compared the
performance of R5 N and X-Vine.

AttachmentSize
PDF icon SupritiSinghMasterThesis.pdf608.27 KB