###
计算机系统应用英文版:2022,31(3):262-268
本文二维码信息
码上扫一扫!
基于节点共边的异构部分重复码构造
(长安大学 信息工程学院, 西安 710064)
Construction of Heterogeneous Fractional Repetition Codes Based on Node Common Edge
(School of Information Engineering, Chang’an University, Xi’an 710064, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 565次   下载 1082
Received:May 07, 2021    Revised:June 08, 2021
中文摘要: 为了满足分布式存储系统的动态存储和异构存储, 本文提出一种基于节点共边的异构部分重复码(heterogeneous fractional repetition codes based on node common edge, HFRC-NCE)的构造算法. 具体地, 将MDS码编码后的数据块分为冷数据块和热数据块, 结合节点共边的特性, 分别将冷数据块和热数据块复制不同的倍数存储到各个节点中, 构造的异构部分重复码更加简单直观, 可实现故障节点的精确无编码修复. 理论分析表明, 与基于完全图和部分正则图构造的部分重复码相比, 基于节点共边的异构部分重复码虽然存储开销和修复带宽开销略大, 但其节点修复选择度更高, 节点存储数据容量更多样化, 重构度更小.
Abstract:In order to solve the dynamic and heterogeneous storage of distributed storage systems, this paper proposes a construction algorithm of heterogeneous fractional repetition codes based on node common edge (HFRC-NCE) is proposed in this paper. In particular, the data blocks encoded by MDS code are divided into cold and hot data blocks, which are copied and stored with different multiples in storage nodes. Moreover, combined with the characteristic of node common edge, the structure of the heterogeneous fractional repetition codes is more simple and intuitive, which can realize the precise non-coding repair of fault nodes. Compared with the fractional repetition codes constructed by complete graph and partial regular graph, theoretical analyses show that, although the storage overhead and bandwidth overhead of HFRC-NCE are a litter larger, its node repair options are larger and the node storage capacities are more diverse. Meanwhile, The reconstruction degree of HFRC-NCE is much smaller.
文章编号:     中图分类号:    文献标志码:
基金项目:
引用文本:
田松涛.基于节点共边的异构部分重复码构造.计算机系统应用,2022,31(3):262-268
TIAN Song-Tao.Construction of Heterogeneous Fractional Repetition Codes Based on Node Common Edge.COMPUTER SYSTEMS APPLICATIONS,2022,31(3):262-268