Preserving Peer Replicas By Rate-Limited Sampled Voting in LOCKSS

Details Preserving Peer Replicas By Rate-Limited Sampled Voting in LOCKSS Preserving Peer Replicas By Rate-Limited Sampled Voting in LOCKSS

2003-03-25

arxiv.org/abs/cs/0303026v3

Computer Science

Distributed, Parallel, and Cluster Computing

25 Pages, 10 figures. Extended version of conference paper

Scientific paper

The LOCKSS project has developed and deployed in a world-wide test a peer-to-peer system for preserving access to journals and other archival information published on the Web. It consists of a large number of independent, low-cost, persistent web caches that cooperate to detect and repair damage to their content by voting in "opinion polls." Based on this experience, we present a design for and simulations of a novel protocol for voting in systems of this kind. It incorporates rate limitation and intrusion detection to ensure that even some very powerful adversaries attacking over many years have only a small probability of causing irrecoverable damage before being detected.

Affiliated with

Also associated with

No associations

Rating

Preserving Peer Replicas By Rate-Limited Sampled Voting in LOCKSS 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 Preserving Peer Replicas By Rate-Limited Sampled Voting in LOCKSS, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Preserving Peer Replicas By Rate-Limited Sampled Voting in LOCKSS will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-75615