哈夫曼树的异构部分重复码构造  

Construction of Heterogeneous Fractional Repetition Codes of Huffman Tree

作　　者：余春雷 王静[3] 杨成福 彭小利 YU Chun-lei;WANG Jing;YANG Cheng-fu;PENG Xiao-li(Intelligent Manufacturing Institute,Sichuan University of Arts and Science,Dazhou 635002,China;Intelligent Manufacturing Industry Technology Research Institute,Dazhou 635002,China;School of Information Engineering,Chang'an University,Xi’an 710064,China)

机构地区：[1]四川文理学院智能制造学院,达州635002 [2]智能制造产业技术研究院,达州635002 [3]长安大学信息工程学院,西安710064

出　　处：《北京邮电大学学报》2021年第6期116-121,共6页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(62001059);陕西省重点研发计划项目(2021GY-019);智能制造产业技术研究院开放基金项目(ZNZZ2106)。

摘　　要：针对分布式存储系统中数据被访问频率的不同,提出一种基于哈夫曼树的可变重复度的异构部分重复(HVFR)码,将不同访问频率的数据块作为哈夫曼树带有确定权值的叶子节点,构造哈夫曼树并确定数据块的重复度,利用成对平衡设计构造异构部分的重复码,能够提高热数据的并行访问速度和系统存储效率.性能分析和实验结果表明,与里所码以及简单再生码相比,HVFR码可以显著减少故障节点的修复时间及修复局部性,提高热数据的并行访问速度,达到负载均衡,且计算复杂度低.Considering access frequency differences of data in distributed storage systems,a heterogeneous variable fractional repetition(HVFR)code based on Huffman tree is proposed.First,taking the data blocks with different access frequencies as the weighted leaf nodes of the Huffman tree,the Huffman tree is constructed and the duplication of the data blocks is determined.Then,the pairwise balanced design is used to construct heterogeneous fractional repetition codes.Performance analysis and experimental results show that,compared with reed-solomon codes and simple regenerating codes,HVFR codes can significantly reduce the repair time and repair locality of the failed nodes,improves the parallel access speed of the hot data,and achieves load balance with low computation complexity.

关 键 词：分布式存储 冷热数据 部分重复码 哈夫曼树 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]