Preserving Peer Replicas by Rate-Limited Sampled Voting (2003)
Cached
Download Links
- [mosquitonet.stanford.edu]
- [mosquitonet.stanford.edu]
- [mosquitonet.stanford.edu]
- [berkeley.intel-research.net]
- [www.eecs.harvard.edu]
- [berkeley.intel-research.net]
- [www.eecs.harvard.edu]
- [eecs.harvard.edu]
- [berkeley.intel-research.net]
- [www.cs.rochester.edu]
- [www.cs.fsu.edu]
- [www.cse.nd.edu]
- [www.cs.fsu.edu]
- [www.nd.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In SOSP |
| Citations: | 42 - 9 self |
BibTeX
@INPROCEEDINGS{Maniatis03preservingpeer,
author = {Petros Maniatis and David S. H. Rosenthal and Mema Roussopoulos and Mary Baker and Yanto Muliadi},
title = {Preserving Peer Replicas by Rate-Limited Sampled Voting},
booktitle = {In SOSP},
year = {2003},
pages = {44--59}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The LOCKSS project has developed and deployed in a worldwide 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.
