Processing

Please wait...

Settings

Settings

Goto Application

1. WO2014153716 - METHODS FOR ENCODING MINIMUM BANDWIDTH REGENERATING CODE AND REPAIRING STORAGE NODE

Publication Number WO/2014/153716
Publication Date 02.10.2014
International Application No. PCT/CN2013/073180
International Filing Date 26.03.2013
IPC
G06F 11/10 2006.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
11Error detection; Error correction; Monitoring
07Responding to the occurrence of a fault, e.g. fault tolerance
08Error detection or correction by redundancy in data representation, e.g. by using checking codes
10Adding special bits or symbols to the coded information, e.g. parity check, casting out nines or elevens
CPC
G06F 11/1076
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
11Error detection; Error correction; Monitoring
07Responding to the occurrence of a fault, e.g. fault tolerance
08Error detection or correction by redundancy in data representation, e.g. by using checking codes
10Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
1076Parity data used in redundant arrays of independent storages, e.g. in RAID systems
G06F 11/1088
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
11Error detection; Error correction; Monitoring
07Responding to the occurrence of a fault, e.g. fault tolerance
08Error detection or correction by redundancy in data representation, e.g. by using checking codes
10Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
1076Parity data used in redundant arrays of independent storages, e.g. in RAID systems
1088Reconstruction on already foreseen single or plurality of spare disks
G06F 2211/1028
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
2211Indexing scheme relating to details of data-processing equipment not covered by groups G06F3/00 - G06F13/00
10Indexing scheme relating to G06F11/10
1002Indexing scheme relating to G06F11/1076
1028Distributed, i.e. distributed RAID systems with parity
H03M 13/1515
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
05using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
13Linear codes
15Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
151using error location or error correction polynomials
1515Reed-Solomon codes
H03M 13/373
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
373with erasure correction and erasure determination, e.g. for packet loss recovery or setting of erasures for the decoding of Reed-Solomon codes
H03M 13/3761
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
3761using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes
Applicants
  • 北京大学深圳研究生院 PEKING UNIVERSITY SHENZHEN GRADUATE SCHOOL [CN]/[CN]
  • 李挥 LI, Hui [CN]/[CN]
Inventors
  • 李挥 LI, Hui
  • 侯韩旭 HOU, Hanxu
  • 朱兵 ZHU, Bing
Agents
  • 深圳市科吉华烽知识产权事务所(普通合伙) SHENZHEN KINDWALF INTELLECTUAL PROPERTY FIRM
Priority Data
Publication Language Chinese (ZH)
Filing Language Chinese (ZH)
Designated States
Title
(EN) METHODS FOR ENCODING MINIMUM BANDWIDTH REGENERATING CODE AND REPAIRING STORAGE NODE
(FR) PROCÉDÉS DE CODAGE D'UN CODE DE RÉGÉNÉRATION DE BANDE PASSANTE MINIMALE ET DE RÉPARATION D'UN NŒUD DE STOCKAGE
(ZH) 一种最小带宽再生码的编码和存储节点修复方法
Abstract
(EN)
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.
(FR)
La présente invention concerne un procédé destiné à coder un code de régénération de bande passante minimale, comprenant les étapes suivantes consistant : à diviser des données originales avec la taille B de manière égale en blocs de données k(k+1)/2 pour obtenir un premier paquet de données ; à utiliser le premier paquet de données pour réaliser une matrice symétrique du système S avec la dimension de k × k ; à réaliser des codes d'identification de codage k, chaque code d'identification de codage comprenant des éléments k ; à effectuer une opération respectivement sur une rangée de la matrice de système et les codes d'identification de codage pour obtenir un paquet de données de codage ; à sélectionner respectivement, de rangées différentes n-k de la matrice de système pour répéter l'étape mentionnée ci-dessus pour obtenir un ensemble de paquets de données de codage n-k ; à réaliser une matrice de contrôle P avec la dimension de (n-k) × k à l'aide d'un numéro de série de code d'identification de codage g de l'ensemble Pg des paquets de données de codage sous la forme d'un numéro de rangée ; et à stocker respectivement chaque rangée de la matrice de système et de la matrice de codage dans un nœud de stockage. La présente invention concerne également un procédé destiné à réparer le nœud de stockage mentionné ci-dessus. La mise en œuvre des procédés de codage d'un code de régénération de bande passante minimale et de réparation d'un nœud de stockage dans la présente invention présente les effets avantageux suivants: un fonctionnement simple, de faibles surdébits, et une réparation de bande passante minimale.
(ZH)
本发明涉及一种最小带宽再生码的编码方法,包括如下步骤:将大小为B的原始数据平均分为k(k+1)/2个数据块,得到第一数据包;使用第一数据包构建尺寸为k×k的、对称的系统矩阵S;构建k个编码标识码,每个编码标识码包括k个元素;分别将所述系统矩阵的一列与编码标识码运算得到的编码数据包;分别选择n-k个不同的系统矩阵的列重复上述步骤,得到n-k个编码数据包集;以所述编码数据包集Pg的编码标识码编号g为其列号,构建大小为(n-k)×k的校验矩阵P;分别将所述系统矩阵和编码矩阵的每行存储到一个存储节点。本发明还涉及一种上述存储节点的修复方法。实施本发明的最小带宽再生码的编码和存储节点修复方法,具有以下有益效果:运算简单、开销小、修复带宽较小。
Also published as
Latest bibliographic data on file with the International Bureau