摘要
针对分布式存储系统故障节点修复问题,提出一种部分重复(FR)码的构造算法。由Hadamard矩阵经过简单变换直接构造FR码。随后引入了分组思想,由8阶Hadamard矩阵构造分组FR码(HGFR),构造更加简洁直观,实现多故障节点在局部修复组内进行精确无编码修复。理论分析发现,与RS码和SRC简单再生码相比,设计的HGFR码在分布式存储系统节点发生故障时的修复局部性、修复复杂度和修复带宽开销都降低,且修复效率提高,减少了故障节点的修复时间。
In order to solve the problem of fault node repair in distributed storage system,a construction algorithm of fractional repetition(FR)code is proposed.Specifically,the FR code is constructed directly by Hadamard matrix through simple transformation.Then,the grouping idea is introduced and the 8-order Hadamard matrix is used to construct the grouping FR code,which is more concise and intuitive and can realize the precise non-coding repair of multiple fault nodes in the local repair group.Compared with Reed-Solomon(RS)codes and simple regenerating codes(SRC),theoretical analysis shows that designed FR codes have lower repair locality,repair bandwidth overhead and repair complexity.In addition,this method has high repair efficiency and reduces the repair time of failed nodes.
作者
王静
孙伟
何亚锦
沈克勤
张鑫楠
刘向阳
WANG Jing;SUN Wei;HE Ya-jin;SHEN Ke-qin;ZHANG Xin-nan;LIU Xiang-yang(School of Information Engineering,Chang’an University Xi’an 710064;College of Information and Communication,National University of Defense Technology ,Xi’an ,710106)
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2021年第2期173-179,共7页
Journal of University of Electronic Science and Technology of China
基金
国家自然科学基金(62001059)
陕西省自然科学基金(2019JM-386)
陕西省重点研发计划项目(2021GY-019)。
