基于分布式存储的OHitchhiker码

OHitchhiker code based on distributed storage

为推进纠删码在分布式存储系统中的应用,研究提高系统修复效率的算法。Hitchhiker码作为一种最新的具有最优存储空间和较低修复成本的纠删码,已在Hadoop等分布式系统中部署实现。针对目前Hitchhiker码采用均分的数据分配模式,存在网络带宽浪费的问题,提出一种最优分配的Hitchhiker编码(optimal allocation of Hitchhiker,OHitchhiker)。通过在编码的分配环节引入一种动态选择分配算法,使得OHitchhiker码可以针对不同(n,k)值选择具有最小修复代价的编码结构。理论分析以及实验结果验证了OHitchhiker码在保持较低存储空间的同时,进一步降低了下载带宽。

To advance the application of erasure codes in distributed storage system,the algorithm to improve the efficiency of system repair was studied.An Hitchhiker code,as a new erasure code with optimal storage space and low repair cost,has been deployed in distributed systems such as Hadoop.Aiming at the problem of network bandwidth waste in the current equalization data distribution mode for Hitchhiker,an optimal allocation of Hitchhiker code(OHitchhiker)was proposed.By introducing a dynamic selection allocation algorithm into the coding allocation link,OHitchhiker selected the coding structure with the minimum repair cost for different(n,k)values.Theoretical analysis and experimental results verify that the OHitchhiker code further reduces the repair bandwidth while maintaining a lower storage space.