Preserving peer replicas by rate-limited sampled voting
- 19 October 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 37 (5) , 44-59
- https://doi.org/10.1145/945445.945451
Abstract
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.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- TanglerPublished by Association for Computing Machinery (ACM) ,2001
- Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utilityPublished by Association for Computing Machinery (ACM) ,2001
- Wide-area cooperative storage with CFSPublished by Association for Computing Machinery (ACM) ,2001
- OceanStorePublished by Association for Computing Machinery (ACM) ,2000
- A prototype implementation of archival IntermemoryPublished by Association for Computing Machinery (ACM) ,1999
- Bimodal multicastACM Transactions on Computer Systems, 1999
- Byzantine quorum systemsDistributed Computing, 1998
- Secure agreement protocolsPublished by Association for Computing Machinery (ACM) ,1994
- A case for redundant arrays of inexpensive disks (RAID)Published by Association for Computing Machinery (ACM) ,1988
- New directions in cryptographyIEEE Transactions on Information Theory, 1976