Reliable Data Storage in Distributed Hash Tables

Details Reliable Data Storage in Distributed Hash Tables Reliable Data Storage in Distributed Hash Tables

2005-07-29

arxiv.org/abs/cs/0507072v3

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

Distributed Hash Tables offer a resilient lookup service for unstable distributed environments. Resilient data storage, however, requires additional data replication and maintenance algorithms. These algorithms can have an impact on both the performance and the scalability of the system. In this paper, we describe the goals and design space of these replication algorithms. We examine an existing replication algorithm, and present a new analysis of its reliability. We then present a new dynamic replication algorithm which can operate in unstable environments. We give several possible replica placement strategies for this algorithm, and show how they impact reliability and performance. Finally we compare all replication algorithms through simulation, showing quantitatively the difference between their bandwidth use, fault tolerance and performance.

Affiliated with

Also associated with

No associations

Rating

Reliable Data Storage in Distributed Hash Tables does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reliable Data Storage in Distributed Hash Tables, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reliable Data Storage in Distributed Hash Tables will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-562410