Preserving Peer Replicas By Rate-Limited Sampled Voting in LOCKSS

Simple item page
dc.creatorManiatis, Petros
dc.creatorRoussopoulos, Mema
dc.creatorGiuli, TJ
dc.creatorRosenthal, David S. H.
dc.creatorBaker, Mary
dc.creatorMuliadi, Yanto
dc.date2003-03-25
dc.date2003-10-17
dc.date.accessioned2026-07-07T03:19:33Z
dc.date.available2026-07-07T03:19:33Z
dc.descriptionThe 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.
dc.description25 Pages, 10 figures. Extended version of conference paper
dc.identifierhttps://arxiv.org/abs/cs/0303026
dc.identifierhttp://arxiv.org/abs/cs/0303026
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31502
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectDigital Libraries
dc.subjectC.2.4; H.3.7; D.4.5
dc.titlePreserving Peer Replicas By Rate-Limited Sampled Voting in LOCKSS
dc.typetext

Files

Collections

arXiv