• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Peer-to-peer networking and applications >Hierarchical codes: A flexible trade-off for erasure codes in peer-to-peer storage systems - Springer
【24h】

Hierarchical codes: A flexible trade-off for erasure codes in peer-to-peer storage systems - Springer

机译：分层代码：对等存储系统中擦除代码的灵活权衡-Springer

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Redundancy is the basic technique to provide reliability in storage systems consisting of multiple components. A redundancy scheme defines how the redundant data are produced and maintained. The simplest redundancy scheme is replication, which however suffers from storage inefficiency. Another approach is erasure coding, which provides the same level of reliability as replication using a significantly smaller amount of storage. When redundant data are lost, they need to be replaced. While replacing replicated data consists in a simple copy, it becomes a complex operation with erasure codes: new data are produced performing a coding over some other available data. The amount of data to be read and coded is d times larger than the amount of data produced, where d, called repair degree, is larger than 1 and depends on the structure of the code. This implies that coding has a larger computational and I/O cost, which, for distributed storage systems, translates into increased network traffic. Participants of Peer-to-Peer systems often have ample storage and CPU power, but their network bandwidth may be limited. For these reasons existing coding techniques are not suitable for P2P storage. This work explores the design space between replication and the existing erasure codes. We propose and evaluate a new class of erasure codes, called Hierarchical Codes, which allows to reduce the network traffic due to maintenance without losing the benefits given by traditional erasure codes.
机译：冗余是在由多个组件组成的存储系统中提供可靠性的基本技术。冗余方案定义了如何生成和维护冗余数据。最简单的冗余方案是复制，但是它会导致存储效率低下。另一种方法是擦除编码，它使用很少的存储量提供与复制相同的可靠性。当冗余数据丢失时，需要对其进行替换。尽管替换复制的数据仅是简单的副本，但使用擦除代码将成为复杂的操作：产生新数据并对其他一些可用数据进行编码。要读取和编码的数据量比产生的数据量大d倍，其中d（称为修复度）大于1，并取决于代码的结构。这意味着编码具有较大的计算和I / O成本，对于分布式存储系统，这会转化为增加的网络流量。对等系统的参与者通常具有足够的存储和CPU能力，但是其网络带宽可能会受到限制。由于这些原因，现有的编码技术不适用于P2P存储。这项工作探索了复制和现有擦除代码之间的设计空间。我们提出并评估了一种新的擦除代码类，称为“分层代码”，它可以减少由于维护引起的网络流量，而又不会失去传统擦除代码所带来的好处。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号