首页> 外文期刊>Operating systems review >Preserving Peer Replicas By Rate-Limited Sampled Voting
【24h】

Preserving Peer Replicas By Rate-Limited Sampled Voting

机译:通过限速采样投票保留对等副本

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:LOCKSS项目已经开发并在全球测试中部署了点对点系统,以保留对网络上发布的期刊和其他档案信息的访问。它由大量独立的,低成本的持久性Web缓存组成,这些缓存通过在“意见调查”中投票来协作,以检测和修复对其内容造成的损坏。基于这一经验,我们提出了一种在此类系统中进行投票的新型协议的设计和仿真。它结合了速率限制和入侵检测功能,以确保即使是攻击了许多年的非常强大的对手,在被检测到之前,也极有可能造成不可挽回的损失。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号