首页> 外国专利> METHODS FOR ENCODING MINIMUM BANDWIDTH REGENERATING CODE AND REPAIRING STORAGE NODE

METHODS FOR ENCODING MINIMUM BANDWIDTH REGENERATING CODE AND REPAIRING STORAGE NODE

机译:最小带宽再生代码编码和存储节点编码的方法

摘要

The present invention relates to a method for encoding a minimum bandwidth regenerating code, comprising the following steps: dividing original data with the size of B equally into k(k+1)/2 data blocks for obtaining a first data packet; using the first data packet to construct a symmetrical system matrix S with the dimension of k × k; constructing k encoding identifier codes, each encoding identifier code comprising k elements; conducting an operation respectively on one row of the system matrix and the encoding identifier codes for obtaining an encoding data packet; respectively selecting n-k different rows of the system matrix for repeating the above-mentioned step for obtaining a set of n-k encoding data packets; constructing a check matrix P with the dimension of (n-k) × k by using an encoding identifier code serial number g of the set Pg of encoding data packets as a row number; and respectively storing each line of the system matrix and the encoding matrix into a storage node. The present invention also relates to a method for repairing the above-mentioned storage node. The implementation of the methods for encoding a minimum bandwidth regenerating code and repairing a storage node in the present invention has the following beneficial effects of: simple operation, low overheads and minor bandwidth repair.
机译:本发明涉及一种对最小带宽再生码进行编码的方法,包括以下步骤:将大小为B的原始数据平均分为k(k + 1)/ 2个数据块,以获得第一数据包;利用所述第一数据包构造尺寸为k×k的对称系统矩阵S;构造k个编码标识码,每个编码标识码包括k个元素;对所述系统矩阵的一行和所述编码标识码分别进行运算,得到编码数据包;分别选择系统矩阵的n-k个不同行,以重复上述步骤以获得一组n-k个编码数据包;通过使用编码数据包的集合P g 的编码标识符代码序列号g作为行号,构造尺寸为(n-k)×k的校验矩阵P;分别将系统矩阵和编码矩阵的每一行存储到存储节点中。本发明还涉及一种用于修复上述存储节点的方法。在本发明中用于编码最小带宽再生代码并修复存储节点的方法的实现具有以下有益效果:简单的操作,低的开销和较小的带宽修复。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号