arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1206.2187cs.DC
收藏

网络分布式存储系统中新型编码方案修复性能的实证研究

An Empirical Study of the Repair Performance of Novel Coding Schemes for Networked Distributed Storage Systems

Lluis Pamies-Juarez, Frédérique Oggier, Anwitaman Datta

摘要:

擦除编码技术正被集成到网络分布式存储系统中,作为一种以比传统复制更少的存储开销为代价提供容错的方式。Reddit是通过修复机制随时间推移而维护的,这可能需要大量的网络资源开销。近年来,一些为分布式存储量身定制的新代码已经被提出来优化存储开销和修复,例如最小化每次修复流量的再生码,或最小化每次修复所接触的节点数量的自修复码。然而,这些编码技术的现有研究主要是理论上的,在简化的假设下,只有一个对象被存储。它们忽略了实际系统必须解决的许多实际问题,例如数据放置,多个存储对象的去相关,或者当多个对象同时修复时对有限网络资源的竞争。本文实证研究了这些新的存储为中心的代码相对于经典的纠删码的修复性能,通过模拟现实的情况下,探索的相互作用的代码参数,故障特征和数据的放置方面的权衡带宽的使用和速度的修复。

英文摘要:

Erasure coding techniques are getting integrated in networked distributed storage systems as a way to provide fault-tolerance at the cost of less storage overhead than traditional replication. Redundancy is maintained over time through repair mechanisms, which may entail large network resource overheads. In recent years, several novel codes tailor-made for distributed storage have been proposed to optimize storage overhead and repair, such as Regenerating Codes that minimize the per repair traffic, or Self-Repairing Codes which minimize the number of nodes contacted per repair. Existing studies of these coding techniques are however predominantly theoretical, under the simplifying assumption that only one object is stored. They ignore many practical issues that real systems must address, such as data placement, de/correlation of multiple stored objects, or the competition for limited network resources when multiple objects are repaired simultaneously. This paper empirically studies the repair performance of these novel storage centric codes with respect to classical erasure codes by simulating realistic scenarios and exploring the interplay of code parameters, failure characteristics and data placement with respect to the trade-offs of bandwidth usage and speed of repairs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑