可修块失效弹性码
Repairable Block Failure Resilient Codes
摘要：
在部署在云计算中的大规模分布式存储系统（DSS）中，导致节点块同时失效（或不可用）的相关故障是常见的。在这种情况下，故障节点的存储数据或内容只能从属于可用块的可用活动节点中重建。为了分析系统对这种块故障的弹性，这项工作引入了块故障弹性（BFR）码的框架，其中数据（例如，DSS中的文件）可以通过从底层码字的每个可用块读出相同数量的码字符号（节点）来解码。此外，引入了可修复BFR码，其中故障块中的任何码字符号可以通过与系统中的剩余块接触来修复。从再生码的角度出发，推导了可修复BFR码的文件大小界，分析了每节点存储量与修复带宽之间的权衡关系，并推导了BFR-MSR和BFR-MBR点。通过利用组合设计来构造针对宽参数集实现这两个操作点的显式代码，其中根据投影平面将底层外码的码字分布到BFR码字符号。
英文摘要：
In large scale distributed storage systems (DSS) deployed in cloud computing, correlated failures resulting in simultaneous failure (or, unavailability) of blocks of nodes are common. In such scenarios, the stored data or a content of a failed node can only be reconstructed from the available live nodes belonging to available blocks. To analyze the resilience of the system against such block failures, this work introduces the framework of Block Failure Resilient (BFR) codes, wherein the data (e.g., file in DSS) can be decoded by reading out from a same number of codeword symbols (nodes) from each available blocks of the underlying codeword. Further, repairable BFR codes are introduced, wherein any codeword symbol in a failed block can be repaired by contacting to remaining blocks in the system. Motivated from regenerating codes, file size bounds for repairable BFR codes are derived, trade-off between per node storage and repair bandwidth is analyzed, and BFR-MSR and BFR-MBR points are derived. Explicit codes achieving these two operating points for a wide set of parameters are constructed by utilizing combinatorial designs, wherein the codewords of the underlying outer codes are distributed to BFR codeword symbols according to projective planes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
