云存储中的弱Dress码
On Weak Dress Codes for Cloud Storage
摘要:
在分布式存储网络中,可以通过重新生成代码来提供可靠性和带宽优化。最近提出了基于表的再生代码,即DRESS(基于分布式复制的精确简单存储)代码,它也优化了磁盘I/O。着装规范由外部MDS代码和内部分数重复(FR)代码组成,FR代码具有复制度$ρ$。基于正则图、可分解设计和二部图的FR码的几种构造是已知的。本文提出了FR码的一种简单模构造法。我们还推广FR码的概念,弱分数重复(WFR)码,每个节点有不同数量的数据包。提出了一种基于部分正则图的WFR码的构造方法。最后给出了强、弱分数重复码的一个简单的广义环构造。
英文摘要:
In a distributed storage network, reliability and bandwidth optimization can be provided by regenerating codes. Recently table based regenerating codes viz. DRESS (Distributed Replication-based Exact Simple Storage) codes has been proposed which also optimizes the disk I/O. Dress codes consists of an outer MDS code with an inner fractional repetition (FR) code with replication degree $ρ$. Several constructions of FR codes based on regular graphs, resolvable designs and bipartite graphs are known. This paper presents a simple modular construction of FR codes. We also generalize the concept of FR codes to weak fractional repetition (WFR) codes where each node has different number of packets. We present a construction of WFR codes based on partial regular graph. Finally we present a simple generalized ring construction of both strong and weak fractional repetition codes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。