实用存储系统维护的可扩展网络编码
Clustered Network Coding for Maintenance in Practical Storage Systems
摘要：
经典的擦除码，如里德-所罗门码，已被公认为是一种有效的替代纯复制，以减少可靠的分布式存储系统中的存储开销。然而，这样的代码在维护过程中经历高开销。在本文中，我们提出了一种新的擦除编码框架，特别是为网络存储系统量身定制。我们的方法依赖于使用随机代码加上一个集群的布局策略，使维护一个失败的机器在多个文件的粒度。我们的修复协议利用网络编码技术，以减少一半的数据量在维护过程中传输，因为几个文件可以同时修复。这种方法，正式证明，并证明了我们的公共实验测试平台上的评估，能够显着降低维护过程中的带宽开销，以及修复故障的时间。此外，实现尽可能简单，旨在部署到实际系统中。
英文摘要：
Classical erasure codes, e.g. Reed-Solomon codes, have been acknowledged as an efficient alternative to plain replication to reduce the storage overhead in reliable distributed storage systems. Yet, such codes experience high overhead during the maintenance process. In this paper we propose a novel erasure-coded framework especially tailored for networked storage systems. Our approach relies on the use of random codes coupled with a clustered placement strategy, enabling the maintenance of a failed machine at the granularity of multiple files. Our repair protocol leverages network coding techniques to reduce by half the amount of data transferred during maintenance, as several files can be repaired simultaneously. This approach, as formally proven and demonstrated by our evaluation on a public experimental testbed, enables to dramatically decrease the bandwidth overhead during the maintenance process, as well as the time to repair a failure. In addition, the implementation is made as simple as possible, aiming at a deployment into practical systems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
