基于可分组设计的部分重复码研究

doi:10.11959/j.issn.1000-436x.2015038

通信学报 ›› 2015, Vol. 36 ›› Issue (2): 98-105.doi: 10.11959/j.issn.1000-436x.2015038

基于可分组设计的部分重复码研究

朱兵,李挥,陈俊,侯韩旭,周泰

北京大学深圳研究生院大数据技术研究院深圳融合网络集成播控技术工程实验室，广东深圳 518055

出版日期:2015-02-25 发布日期:2017-06-27
基金资助:
国家重点基础研究计划(“973计划”)基金资助项目;国家自然科学基金资助项目;广东省自然科学基金资助项目;深圳市基础研究基金资助项目;深圳市基础研究基金资助项目

Research on fractional repetition codes based on group divisible designs

Bing ZHU,Hui LI,Jun CHEN,Han-xu HOU,Tai ZHOU

Institute of Big Data Technologies ＆Shenzhen Engineering Laboratory of Converged Network Technology,Peking University Shenzhen Graduate School,Shenzhen 518055,China

Online:2015-02-25 Published:2017-06-27
Supported by:
The National Basic Research Program of China (973 Program);The National Natural Science Foundation of China;The Natural Science Foundation of Guangdong Province;The Basic Research Program of Shenzhen;The Basic Research Program of Shenzhen

摘要/Abstract

摘要：

针对最小带宽再生情形下的有效修复问题，提出了一种新型部分重复（FR,fractional repetition）码设计。该设计由外部最大距离可分（MDS,maximum distance separable）码和内部重复码组成，称为 GDDBFR（group divisible design based FR）码，可以达到随机访问模式下的系统存储容量，并且能够在很大范围内选择构造参数。理论分析指出，尽管 GDDBFR 码采用基于表格的修复方式，但通常具有大量的节点修复选择方案。此外，实验结果表明，与传统的RS（Reed-Solomon）码和再生码相比，GDDBFR码可以显著地减少失效修复时间。

关键词: 部分重复码, 可分组设计, 存储容量, 节点修复选择度, 修复时间

Abstract:

A novel design of FR (fractional repetition) codes was proposed which aims at providing efficient repair at the minimum bandwidth regenerating point.The design consisted of an outer MDS (maximum distance separable) code and an inner repetition code,called GDDBFR (group divisible design based FR) codes.The proposed codes can achieve the system storage capacity under the random access model and are available for a wide range of parameters.Despite of the table-based repair,theoretical analysis identifies that GDDBFR codes generally have large node repair alternatives.Furthermore,experimental results show that GDDBFR codes can significantly reduce the failure repair time when compared with legacy RS (Reed-Solomon) codes and regenerating codes in the domain.

Key words: fractional repetition codes, group divisible designs, storage capacity, node repair alternativity, repair time

朱兵,李挥,陈俊,侯韩旭,周泰. 基于可分组设计的部分重复码研究[J]. 通信学报, 2015, 36(2): 98-105.

Bing ZHU,Hui LI,Jun CHEN,Han-xu HOU,Tai ZHOU. Research on fractional repetition codes based on group divisible designs[J]. Journal on Communications, 2015, 36(2): 98-105.

图/表 7

图1

图2

图3

表1

图4

图5

图6

参考文献 13

1	GHEMAWAT S , GOBIOFF H , LEUNG S . The Google file system[A]. The 19th ACM Symposium on Operating Systems Principles[C]. Lake George,New York,USA, 2003.29-43.
2	DIMAKIS A G , RAMCHANDRAN K , WU Y , et al. A survey on network codes for distributed storage[J]. Proceedings of the IEEE, 2011,99(3):476-489.
3	FAN B , TANTISIRIROJ W , XIAO L , et al. Diskreduce:Replication as a Prelude to Erasure Coding in Data-Intensive Scalable Computing[R]. Parallel Data Laboratory,Carnegie Mellon University[C]. Pittsburgh,PA,USA, 2011.
4	DIMAKIS A G , GODFREY P B , WU Y , et al. Network coding for distributed storage systems[J]. IEEE Transactions on Information Theory, 2010,56(9):4539-4551.
5	RASHMI K V , SHAH N B , KUMAR P V . Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction[J]. IEEE Transactions on Information Theory, 201157(8):5227-5239.
6	RASHMI K V , SHAH N B , KUMAR P V , et al. Explicit construction of optimal exact regenerating codes for distributed storage[A]. The 47th Annual Allerton Conference on Communication,Control,and Computing[C]. Monticello,IL,USA, 2009.1243-1249.
7	RASHMI K V , SHAH N B , KUMAR P V , et al. Explicit and optimal exact-regenerating codes for the minimum-bandwidth point in distributed storage[A]. IEEE International Symposium on Information Theory Proceedings[C]. Austin,TX,USA, 2010.1938-1942.
8	VENKATESAN V . Fast Rebuilds in Distributed Storage Systems Using Network Coding[R]. Zurich Research Laboratory, IBM Research GmbH,Zurich, 2009.
9	ROUAYHEB S E , RAMCHANDRAN K . Fractional repetition codes for repair in distributed storage systems[A]. The 48th Annual Allerton Conference on Communication,Control,and Computing[C]. Allerton,IL,USA, 2010.1510-1517.
10	PAWAR S , NOORSHAMS N , ROUAYHEB S E , et al. Dress codes for the storage cloud:simple randomized constructions[A]. IEEE International Symposium on Information Theory Proceedings[C]..St. Petersburg,Russia, 2011.2338-2342.
11	KOO J , GILL J . Scalable constructions of fractional repetition codes in distributed storage systems[A]. The 49th Annual Allerton Conference on Communication,Control,and Computing[C]. Monticello,IL,USA, 2011.1366-1373.
12	OLMEZ O , RAMAMOORTHY A . Repairable replication-based storage systems using resolvable designs[A]. The 50th Annual Allerton Conference on Communication,Control,and Computing[C]. Monticello,IL,USA, 2012.1174-1181.
13	COLBOURN C J , DINITZ J H . Handbook of Combinatorial Designs,Second Edition[M]. Chapman and Hall/CRC, 2006.

点集v (符号θ)	组容量s (节点容量d )	型(type)	重复数 r (复制倍数f)	区组数b (节点数n)
6	3	2³	2	4
8	3	2⁴	3	8
9	3	3³	3	9
12	3	2⁶	5	20
12	3	4³	4	16
12	4	3⁴	3	9
14	4	2⁷	4	14
15	3	3⁵	6	30
15	3	5³	5	25
15	4	3⁵	4	15

基于可分组设计的部分重复码研究

Research on fractional repetition codes based on group divisible designs

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 7

参考文献 13

相关文章 0

Metrics

推荐阅读 0