CN108199720A - A kind of node restorative procedure and system for reducing storage overhead and improving remediation efficiency - Google Patents

A kind of node restorative procedure and system for reducing storage overhead and improving remediation efficiency Download PDF

Info

Publication number
CN108199720A
CN108199720A CN201711362733.XA CN201711362733A CN108199720A CN 108199720 A CN108199720 A CN 108199720A CN 201711362733 A CN201711362733 A CN 201711362733A CN 108199720 A CN108199720 A CN 108199720A
Authority
CN
China
Prior art keywords
node
storage overhead
repair
data packet
parity check
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201711362733.XA
Other languages
Chinese (zh)
Other versions
CN108199720B (en
Inventor
代明军
王霞
王晖
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen University
Original Assignee
Shenzhen University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen University filed Critical Shenzhen University
Priority to CN201711362733.XA priority Critical patent/CN108199720B/en
Publication of CN108199720A publication Critical patent/CN108199720A/en
Application granted granted Critical
Publication of CN108199720B publication Critical patent/CN108199720B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, 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
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148—Structural properties of the code parity-check or generator matrix
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]

Abstract

The present invention is suitable for distributed storage technological improvement field, provides a kind of node restorative procedure for reducing storage overhead and improving remediation efficiency, and the node restorative procedure includes the following steps：It is right on piggyback coding frameworks（N, k）System node is grouped and defines systematic vector and encoder matrix by code；S2, corresponding coding mode will be obtained in the encoder matrix substitution coding structure of definition；S3, it is decoded according to coding mode by zigzag and impaired node is repaired in distributed memory system.According to its special coding mode, the code of design is made both to have met MDS properties, storage overhead is again smaller.It in actual mechanical process, is decoded by zigzag, it is low to be effectively reduced decoded complexity, while improves node remediation efficiency again.

Description

A kind of node restorative procedure and system for reducing storage overhead and improving remediation efficiency
Technical field
The invention belongs to distributed storage technological improvement field more particularly to a kind of reduction storage overhead and improve reparation effect The node restorative procedure and system of rate.
Background technology
In large-scale distributed memory system, we can store and analyze large-scale data, however in regular job In the process, the node in system is there are various failures, such as：The loss of data caused by disk failures or broken string.Therefore, really The reliabilty and availability of insurance system interior joint just shows particularly important.
1. in traditional distributed memory system, storage data usually use repetition strategies.I.e. by replicating multiple data On copy and the node of storage in systems.When there is corrupted data to need to carry out data recovery, it is only necessary to find corresponding section The data stored in point, you can restore.
2. in recent years, related scholar proposes a kind of redundancy strategy based on correcting and eleting codes, deposited by increasing redundancy to reduce Expense is stored up, while ensures the reliability of node data when repairing.Its coding mode is：Original data are divided into k original Then this k raw data packets is mapped to n (n >=k) a coded data packet by beginning data packet, appoint and k coded data packet is taken all may be used To recover k raw data packets.Wherein most typical Reed-solomon codes (RS codes) have been widely applied to existing For in digital communication, distributed memory system.
Repeat the storage mode of system：Although it can ensure that the height reliability of data in this way.But it generates a large amount of superfluous Remainder evidence has aggravated the burden of server, and the utilization rate of node is not high, be easy to cause the waste of resource.In addition, with number According to explosive increase, storage overhead also can exponentially type increase.
The shortcomings of general complexity with encoding or decoding of traditional (n, k) code is high, and storage overhead is big, Er Qie During node is repaired, it usually needs read and download the selected total data repaired in node.
Such as in traditional (8,4) code, it is assumed that store two coded data packets in each node, it is arbitrary in this 8 nodes One node damage, is required for appointing the node for taking 4 nodes that could repair damage in remaining node.In repair process, need Read and download 8 coded data packets.
In actual mechanical process, such decoded mode has not only aggravated the burden of network bandwidth, is easily damaged disk, And the also excessive I/O for the occupying system mouth resources in repair process.Cause scalability bad.
Invention content
The purpose of the present invention is to provide a kind of node restorative procedure for reducing storage overhead and improving remediation efficiency and it is System, it is intended to solve the technical issues of above-mentioned.
The invention is realized in this way a kind of node restorative procedure for reducing storage overhead and improving remediation efficiency, described Node restorative procedure includes the following steps：
S1, system node is grouped by (n, k) code on piggyback coding frameworks and defines systematic vector and encodes square Battle array defines systematic vector：A={ a1 a2…ak}T, b={ b1 b2…bk}T, c={ c1 c2…ck}T, d={ d1 d2…dk}T；When When r-1 is odd number, encoder matrix P is：
When r-1 is even number, encoder matrix P is：
When r-1 is odd number or even number, encoder matrix Q is：
S2, corresponding coding mode will be obtained in the encoder matrix substitution coding structure of definition；
S3, it is decoded according to coding mode by zigzag and impaired node is repaired；
Wherein, wherein, k represents the number of system node, and r represents the number of parity check node, and n=k+r, n represent total Conode number, the transposition of T representation vectors,Expression rounds up.
The present invention further technical solution be：When establishing encoder matrix by shifting generation storage in the step S1 Expense, the storage overhead is related with the number of parity check node and system node, and r is bigger, and storage overhead is bigger, and k is bigger, Storage overhead is bigger, wherein storage overhead：
The present invention further technical solution be：R is integer more than or equal to 2, k/r in the step S1；In encoder matrix P In to reducing storage overhead by way of carrying out a primary positive and reversed arrangement with element vectorial line by line.
The present invention further technical solution be：Node reparation is damaged in the step S3 and includes system node reparation and strange Even parity check node reparation；When the system node is repaired, malfunctioning nodeWhen, repair system node need m × (k+ | S1|) A data guarantee the repair free of charge multiple malfunctioning node；Malfunctioning node h ∈ SrWhen, repair system node need m × (k+ | Sr|+r-2) a data guarantee the repair free of charge Multiple malfunctioning node, wherein, m is arbitrary positive integer.
The present invention further technical solution be：When the parity check node is repaired, (n, k) code meets CP-BZD Matter if first parity check node (Node k+1) is impaired, need to appoint from remaining n-1 node and take k node, Mei Gejie Point 2m data packet of storage, repairing first parity check node needs 2mk data packet；If repair other parity check nodes L, L ∈ { k+2 ..., k+r }, reparation is related to the value of r and m, and as r=2, storage order is downloaded from each system node For the last one data packet stored in the data packet of odd number and each system node, also need to read and download the 3rd of node k+1 It is a, the 5th, the 2m-1 data guarantee the repair free of charge again be damaged node；As r >=3, it is strange to download storage order from each system node Several data packet { qi, the last one data packet for storing in i={ 1 ..., k } and each system node and read f1, f2∈ { k+1 ..., k+r } in L storage order all information bits of malfunctioning node are repaired for the data packet of even number, wherein, m is arbitrary Positive integer, f represent to remove other parity check nodes of malfunctioning node.
Another object of the present invention is to provide a kind of node repair system for reducing storage overhead and improving remediation efficiency, The node repair system includes：
Definition module, for system node is grouped by (n, k) code on piggyback coding frameworks and is defined system to Amount and encoder matrix define systematic vector：A={ a1 a2…ak}T, b={ b1 b2…bk}T, c={ c1 c2…ck}T, d={ d1 d2…dk}T；When r-1 is odd number, encoder matrix P is：
When r-1 is even number, encoder matrix P is：
When r-1 is odd number or even number, encoder matrix Q is：
Coding mode acquisition module obtains corresponding coding staff for the encoder matrix of definition to be substituted into coding structure Formula；
Node repair module repairs impaired node for being decoded according to coding mode by zigzag；
Wherein, wherein, k represents the number of system node, and r represents the number of parity check node, and n=k+r, n represent total Conode number, the transposition of T representation vectors,Expression rounds up.
The present invention further technical solution be：It is deposited in the definition module when establishing encoder matrix by shifting generation Expense is stored up, the storage overhead is related with the number of parity check node and system node, and r is bigger, and storage overhead is bigger, and k is got over Greatly, storage overhead is bigger, wherein storage overhead：
The present invention further technical solution be：R is integer more than or equal to 2, k/r in the definition module；In coding square To reducing storage overhead by way of carrying out a primary positive and reversed arrangement with element vectorial line by line in battle array P.
The present invention further technical solution be：Node reparation is damaged in the node repair module to repair including system node Multiple and parity check node reparation；When the system node is repaired, malfunctioning nodeWhen, repair system node needs m × (k+ |S1|) a data guarantee the repair free of charge multiple malfunctioning node；During malfunctioning node h ∈ Sr, repair system node need m × (k+ | Sr|+r-2) number According to guaranteeing the repair free of charge multiple malfunctioning node, wherein, m is arbitrary positive integer.
The present invention further technical solution be：When the parity check node is repaired, (n, k) code meets CP-BZD Matter if first parity check node (Node k+1) is impaired, need to appoint from remaining n-1 node and take k node, Mei Gejie Point 2m data packet of storage, repairing first parity check node needs 2mk data packet；If repair other parity check nodes L, L ∈ { k+2 ..., k+r }, reparation is related to the value of r and m, and as r=2, storage order is downloaded from each system node For the last one data packet stored in the data packet of odd number and each system node, also need to read and download the 3rd of node k+1 It is a, the 5th, the 2m-1 data guarantee the repair free of charge again be damaged node；As r >=3, it is strange to download storage order from each system node Several data packet { qi, the last one data packet for storing in i={ 1 ..., k } and each system node and read f1, f2∈ { k+1 ..., k+r } in L storage order all information bits of malfunctioning node are repaired for the data packet of even number, wherein, m is arbitrary Positive integer, f represent to remove other parity check nodes of malfunctioning node.
The beneficial effects of the invention are as follows：In distributed memory system, according to its special coding mode, make the code of design Both MDS properties had been met, storage overhead is again smaller.It in actual mechanical process, is decoded, can be effectively reduced by zigzag Decoded complexity is low, while improves node remediation efficiency again.
Description of the drawings
Fig. 1 is the flow of reduction storage overhead provided in an embodiment of the present invention and the node restorative procedure for improving remediation efficiency Figure.
Fig. 2 is 84 yards of schematic diagrames one provided in an embodiment of the present invention.
Fig. 3 is 84 yards of schematic diagrames two provided in an embodiment of the present invention.
Fig. 4 is the structure of reduction storage overhead provided in an embodiment of the present invention and the node repair system for improving remediation efficiency Block diagram.
Specific embodiment
As shown in Figure 1, the node restorative procedure provided by the invention for reducing storage overhead and improving remediation efficiency, is described in detail It is as follows：
System node is grouped (n, k) code on piggyback coding frameworks and defines systematic vector and volume by step S1 Code matrix, on the coding framework of piggyback, (zigzag decodings) is decoded using sawtooth, thus reduces decoding complex degree It is node recovery scenario the improvement proposed to K.V.Rashmi et al. with the remediation efficiency for improving malfunctioning node；It proposes (n, k) code have CP-BZD properties.CP-BZD properties refer to that (n, k) code can carry out zigzag decodings in binary field, it It can tolerate that most n-k nodes break down simultaneously simultaneously.We are divided into raw information s the data that k length is L bits Packet, is expressed as s1..., sk。siJ-th of bit be expressed as sI, j, and sI, j∈ { 0,1 }, wherein SI, jAlso referred to as information Position.According to (n, k) code, this k number is expressed as c according to packet encoder into n data packet (n ＞ k)1..., cn.In addition, we There is ci=si, wherein i=1 ..., k.Preceding k node packet is called system node, remaining n-k data packet is known as even-odd check section Point.
Zigzag decodings pertain only to the back substitution operation in two element field, and decoding step likeness in form Z has low multiple in decoding process Miscellaneous characteristic, is widely used in two element field, and in decoding process, we attempt to find an exposed position first, this Exposure position is not Chong Die with any of other bits in data packet.It can be considered as restoring position.Then from other odd even schools It tests in data packet and subtracts the position.This process is repeated, is obtained until all information bits are decoded.
For arbitrary (n, k) code, k represents the number of system node, the data packet stored in system node we be referred to as For raw data packets.R (r=n-k) represents the number of parity check node, the data packet stored in parity check node we claim For verification data packet, wherein, we are referred to as data packet for raw data packets and verification data packet, can be stored in each node Multiple data packets, it is desirable that r >=2, k/r are integer.System node is divided into r groups, is expressed as S1……Sr, wherein
We define systematic vector：A={ a1 a2…ak}T, b={ b1 b2…bk}T
C={ c1 c2…ck}T, d={ d1 d2…dk}T
The transposition of T representation vectors, and between every group of systematic component independently of each other.
When r-1 is odd number, encoder matrix P is：
When r-1 is even number, encoder matrix P is：
R-1 is odd number or even number, is had
Wherein, k represents the number of system node, and r represents the number of parity check node, and n=k+r, n represent total conode Number, the transposition of T representation vectors,Expression rounds up.
In the present inventionExpression rounds up, the corresponding raw data packets of each element representation in encoder matrix P and Q Shift amount when forming verification data packet.Wherein 0 represents that displacement is 0 bit, and k represents that displacement is k bits, and -1 represents therewith Corresponding raw data packets are not involved in operation.
The encoder matrix of definition is substituted into coding structure and obtains corresponding coding mode by step S2；Represent each with 2m The number of the data packet stored in node, m are arbitrary positive integer, as m=2, coding mode such as 1 institute of table of general type Show.
Table 1
Wherein：Vr=Pr+qr。
The storage redundancy that storage overhead refers to encoder matrix by shifting to generate, in the present invention, storage overhead is by P squares Maximum element determines in battle array.Storage overhead：
Therefore, the storage overhead of the coding mode is related with the number of parity check node and system node, and r is bigger, deposits Storage expense is bigger, and k is bigger, and storage overhead is bigger.
The present invention is decoded by zigzag, can substantially reduce decoding complex degree, while deposit by downloading in specific node The data packet of storage is averaged download to reduce data, effective remediation efficiency for improving node.In addition, it is stored when in each node Data packet when can expand to 2m, coding rule is consistent with table 1, and it is the number stored in parity check node k+1 that need to only change According to packet, jth ∈ { 2,4 ... 2m-2 } a data packet stored in parity check node k+2 to k+r is all added to odd even + 1 data packet of jth of check-node k+1.As shown in table 1, during m=2, stored in j=2, parity check node k+1 the 3rd Data packet is
Step S3 is decoded by zigzag according to coding mode and impaired node is repaired；Volume based on piggyback Code frame, when individual node breaks down, can reduce number by reading and downloading the data packet stored in specific node According to download, so as to improve the average healing efficiency of node.In addition in the present invention, when the data packet stored in each node can be with When expanding to 2m, coding rule is consistent with table 1, and need to change is the data packet stored in parity check node k+1, needs handle Jth ∈ { 2,4 ... 2m-2 } a data packet stored in parity check node k+2 to k+r is all added to parity check node k+ 1+1 data packet of jth.
Repair system node：
1st, malfunctioning nodeWithout loss of generality, it will be assumed that h ∈ S1, as shown in table 1, we deposit first from distribution K number is downloaded in storage system according to packet, this k number includes { b according to packet1..., bh-1, bh+1..., bk, p1A }, therefore we Decode bhTo get to systematic vector b={ b1 b2…bk}T, and because ahDownloading data packet { a can be passed throughi}i∈S1{ h }, with And P2b+q2A is obtained, i.e. k+S1A data packet can be obtained by ah, bh.Similarly by downloading { d1..., dh-1, dh+1..., dk, p1D }, it can decode and obtain dh, last chIt can be by P2d+q2C and { ci}i∈S1Decoding obtains, in repair process, it is only necessary to 2 ×(k+|S1|) a data packet can restore failure system node h.When m is arbitrary positive integer, repair system node needs m ×(k+|S1|) a data packet can repair malfunctioning node.
2nd, malfunctioning node h ∈ Sr, as shown in table 1, we download k number according to packet, this k first from distributed memory system A data packet includes { b1..., bh-1, bh+1..., bk, p1A }, therefore we can decode bh, then from parity check node k+r Middle download Vra+PrB, while read and download second data stored in parity check node k+2 to parity check node k+r Wrap { pib+qiA } i ∈ { 2 ..., r-1 }, you can decoding obtains ah, repair ah, bhWhole process needs the data packet for reading and downloading Number be k+ | Sr|+r-2 can similarly repair c as shown in table 1h, dh, when m is arbitrary positive integer, repair system node Need m × (k+ | Sr|+r-2) a data packet can repair malfunctioning node.
Repair parity check node；
If first parity check node (Node k+1) is impaired, since (n, k) code of the present invention meets CP-BZD properties, It needs to appoint from remaining n-1 node and takes k node, since each node stores 2m data packet, then need 2mk data Packet could restore first parity check node.
Other parity check node L are repaired, wherein L ∈ { k+2 ..., k+r }, remediation efficiency is related with the value of r and m, As r=2, need to download the data packet { q that storage order is odd number from each system nodei, i={ 1 ..., k } and each The last one data packet stored in system node also needs to read and download the 3rd of node k+1, the 5th in addition, 2m- 1 data packet, you can repair impaired node.As r >=3, it would be desirable to which it is strange to download storage order from each system node Several data packet { qi, the last one data packet for storing in i={ 1 ..., k } and each system node and read f1, f2∈ { k+1 ..., k+r } in L storage order be even number data packet.It can restore all information bits of malfunctioning node, f represents to remove Other parity check nodes of malfunctioning node.
As Figure 2-3.Assuming that we will restore information bit from c3 and c4.The sequence of information bit recovery is by corresponding bracket Digital representation.First, the leftmost information bit in c4 is s21, we can directly obtain it because they be not related to Any calculating of other information position.They can be considered as first recovery position, and index is 1 in bracket respectively.Then I By s21First of c3 is replaced with, and restores s11.It is second recovery position, therefore 2 are indexed in bracket.Similarly, lead to It crosses s11The second of c4 is substituted into, s can be restored22, it is that third restores position, therefore 4 are indexed in bracket.Repeat the solution Code process, until all information bits are all resumed.
For (8,4) code, k=4, r=8-4=4, m=1 store two data packets in each node.
System node is divided into 4 groups by us first, S1={ Node1 }, S2={ Node2 }, S3={ Node3 }, S4= {Node4}
Define systematic vector：A={ a1, a2, a3, a4}T；B={ b1, b2, b3, b4}T
Encoder matrix is：
Wherein, 0,1,2,3 represents that the displacement of original component is 0 bit respectively, 1 bit, 2 bits, 3 bits, -1 Represent that corresponding original component does not participate in encoding operation.
Corresponding coding mode is as shown in table 2：
Table 2
We are decoded using zigzag in the present invention, as shown in Fig. 2, data packet is divided into system node and odd even by us Check-node, wherein Node1, Node2, Node3, Node4 are system nodes, and Node5, Node6, Node7, Node8 are odd evens Check-node, each in parity check node are all the corresponding positions by system node as obtained by shifter-adder.Due to this Code meets CP-BZD properties, takes 4 data packets that can restore initial data so appointing.Without loss of generality, we from Node1, Restore initial data in Node2, Node5, Node6, small label represents the decoding order of bit, in Node6, S3,1No It is added, can immediately arrive at other bits, we label it as 1, and expression is first and decodes obtained bit, will S3,1It is updated in Node5, since first bit of Node5 is S1,1+S2,1+S3,1+S4,1, therefore we can obtain S4,1, 2 are labeled as, by S4,1It substitutes into Node6, it is possible to which S is obtained according to XOR3,2, iteration successively in this way, it is final we Whole raw information can be recovered.
Node reparation：
If the 1, Node1 is damaged, take fgs encoder data packet b2, b3, b4, p1b, we can repair data packet b1, then Take coded data packet p2b+q2a that can repair a1.In this recovery scenario, it is only necessary to which 5 data packets can repair Node1, with biography The MDS codes of system, which are repaired, compares (8 data packets could repair malfunctioning node), improves 37.5% remediation efficiency.According to similary Mode,
Node2, Node3, reparation also only need 5 data packets；
If the 2, Node4 is damaged, coded data packet is taken, b1, b2, b3, p1b, we, which can decode, obtains b4, p4a+(p4b+ q4A), p3b+q3A, p2b+q2A can repair a4, i.e. 7 coded data packets can repair Node4, compared with traditional MDS codes Compared with, improve 12.5% remediation efficiency.
If the 3, Node5, Node6, Node7, Node8 are damaged, then 8 coded data packets are needed.
As shown in figure 4, another object of the present invention is to provide a kind of section for reducing storage overhead and improving remediation efficiency Point repair system, the node repair system include：
Definition module, for system node is grouped by (n, k) code on piggyback coding frameworks and is defined system to Amount and encoder matrix define systematic vector：A={ a1 a2…ak}T, b={ b1 b2…bk}T, c={ c1 c2…ck}T, d={ d1 d2…dk}T；When r-1 is odd number, encoder matrix P is：
When r-1 is even number, encoder matrix P is：
When r-1 is odd number or even number, encoder matrix Q is：
Coding mode acquisition module obtains corresponding coding staff for the encoder matrix of definition to be substituted into coding structure Formula；
Node repair module repairs impaired node for being decoded according to coding mode by zigzag；
Wherein, wherein, k represents the number of system node, and r represents the number of parity check node, and n=k+r, n represent total Conode number, the transposition of T representation vectors,Expression rounds up.
Storage overhead, the storage overhead and odd even are generated by displacement when establishing encoder matrix in the definition module Check-node is related with the number of system node, and r is bigger, and storage overhead is bigger, and k is bigger, and storage overhead is bigger, wherein storage is opened Pin：
R is integer more than or equal to 2, k/r in the definition module；By to vector line by line in encoder matrix P Element carries out a primary positive and reversed arrangement mode and reduces storage overhead.
Node reparation is damaged in the node repair module and includes system node reparation and parity check node reparation；It is described When system node is repaired, malfunctioning nodeWhen, repair system node need m × (k+ | S1|) a data guarantee the repair free of charge multiple failure section Point；Malfunctioning node h ∈ SrWhen, repair system node need m × (k+ | Sr|+r-2) a data guarantee the repair free of charge multiple malfunctioning node, wherein, m It is arbitrary positive integer.
When the parity check node is repaired, (n, k) code meets CP-BZD properties, if first parity check node (Node k+1) is impaired, need to appoint from remaining n-1 node and take k node, 2m data packet of each node storage, reparation the One parity check node needs 2mk data packet；If repairing other parity check nodes L, L ∈ { k+2 ..., k+r }, repair It is multiple related to the value of r and m, as r=2, storage order is downloaded from each system node as the data packet of odd number and each system The last one data packet stored in system node, also needs to read and download the 3rd of node k+1, the 5th, the 2m-1 data It guarantees the repair free of charge and is damaged node again；As r >=3, the data packet { q that storage order is odd number is downloaded from each system nodei, i= The last one data packet and reading f stored in { 1 ..., k } and each system node1, f2∈ { k+1 ..., k+r } deposit in L All information bits of malfunctioning node are sequentially repaired in storage for the data packet of even number, wherein, m is arbitrary positive integer, and f represents to remove event Hinder other parity check nodes of node.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention All any modification, equivalent and improvement made within refreshing and principle etc., should all be included in the protection scope of the present invention.

Claims (10)

  1. A kind of 1. node restorative procedure for reducing storage overhead and improving remediation efficiency, which is characterized in that the node reparation side Method includes the following steps：
    S1, system node is grouped by (n, k) code on piggyback coding frameworks and defines systematic vector and encoder matrix, Define systematic vector：A={ a1 a2 … ak}T, b={ b1 b2 … bk}T, c={ c1 c2 … ck}T, d={ d1 d2 … dk}T；When r-1 is odd number, encoder matrix P is：
    When r-1 is even number, encoder matrix P is：
    When r-1 is odd number or even number, encoder matrix Q is：
    S2, corresponding coding mode will be obtained in the encoder matrix substitution coding structure of definition；
    S3, it is decoded according to coding mode by zigzag and impaired node is repaired；
    Wherein, k represents the number of system node, and r represents the number of parity check node, and n=k+r, n represent total conode Number, the transposition of T representation vectors,Expression rounds up.
  2. 2. the node restorative procedure according to claim 1 for reducing storage overhead and improving remediation efficiency, which is characterized in that Storage overhead is generated by displacement when establishing encoder matrix in the step S1, the storage overhead and parity check node and The number of system node is related, and r is bigger, and storage overhead is bigger, and k is bigger, and storage overhead is bigger, wherein storage overhead：
  3. 3. the node restorative procedure according to claim 2 for reducing storage overhead and improving remediation efficiency, which is characterized in that R is integer more than or equal to 2, k/r in the step S1；By to carrying out one with element vectorial line by line in encoder matrix P A secondary positive and reversed arrangement mode reduces storage overhead.
  4. 4. the node restorative procedure according to claim 3 for reducing storage overhead and improving remediation efficiency, which is characterized in that Node reparation is damaged in the step S3 and includes system node reparation and parity check node reparation；The system node reparation When, malfunctioning nodeWhen, repair system node need m × (k+ | S1|) a data guarantee the repair free of charge multiple malfunctioning node；Malfunctioning node h ∈ SrWhen, repair system node need m × (k+ | Sr|+r-2) a data guarantee the repair free of charge multiple malfunctioning node, wherein, m is arbitrary positive integer.
  5. 5. the node restorative procedure according to claim 3 for reducing storage overhead and improving remediation efficiency, which is characterized in that When the parity check node is repaired, (n, k) code meets CP-BZD properties, if first parity check node (Node k+1) by Damage, need to appoint from remaining n-1 node and take k node, and each node stores 2m data packet, repair first even-odd check Node needs 2mk data packet；If repairing other parity check nodes L, L ∈ { k+2 ..., k+r }, the value with r and m is repaired Correlation as r=2, downloads storage order to be stored in the data packet of odd number and each system node from each system node The last one data packet, also need to read and download the 3rd of node k+1, the 5th, the 2m-1 data is guaranteed the repair free of charge is damaged section again Point；As r >=3, the data packet { q that storage order is odd number is downloaded from each system nodei, i={ 1 ..., k } and each The last one data packet and reading f stored in system node1, f2∈ { k+1 ..., k+r } in L storage order be even number Data packet repairs all information bits of malfunctioning node, wherein, m is arbitrary positive integer, and other of f expression removing malfunctioning nodes are strange Even parity check node.
  6. A kind of 6. node repair system for reducing storage overhead and improving remediation efficiency, which is characterized in that the node reparation system System includes：
    Definition module, for system node is grouped by (n, k) code on piggyback coding frameworks and is defined systematic vector and Encoder matrix defines systematic vector：A={ a1 a2 … ak}T, b={ b1 b2 … bk}T, c={ c1 c2 … ck}T, d= {d1 d2 … dk}T；When r-1 is odd number, encoder matrix P is：
    When r-1 is even number, encoder matrix P is：
    When r-1 is odd number or even number, encoder matrix Q is：
    Coding mode acquisition module obtains corresponding coding mode for the encoder matrix of definition to be substituted into coding structure；
    Node repair module repairs impaired node for being decoded according to coding mode by zigzag；
    Wherein, wherein, k represents the number of system node, and r represents the number of parity check node, and n=k+r, n expression save in total Point number, the transposition of T representation vectors,Expression rounds up.
  7. 7. the node repair system according to claim 6 for reducing storage overhead and improving remediation efficiency, which is characterized in that Storage overhead, the storage overhead and parity check node are generated by displacement when establishing encoder matrix in the definition module Related with the number of system node, r is bigger, and storage overhead is bigger, and k is bigger, and storage overhead is bigger, wherein storage overhead：
  8. 8. the node repair system according to claim 7 for reducing storage overhead and improving remediation efficiency, which is characterized in that R is integer more than or equal to 2, k/r in the definition module；By to being carried out with element vectorial line by line in encoder matrix P A primary positive and reversed arrangement mode reduces storage overhead.
  9. 9. the node repair system according to claim 8 for reducing storage overhead and improving remediation efficiency, which is characterized in that Node reparation is damaged in the node repair module and includes system node reparation and parity check node reparation；The system node During reparation, malfunctioning nodeWhen, repair system node need m × (k+ | S1|) a data guarantee the repair free of charge multiple malfunctioning node；Failure section Point h ∈ SrWhen, repair system node need m × (k+ | Sr|+r-2) a data guarantee the repair free of charge multiple malfunctioning node, wherein, m is arbitrary just Integer.
  10. 10. the node repair system according to claim 9 for reducing storage overhead and improving remediation efficiency, feature exist In when the parity check node is repaired, (n, k) code meets CP-BZD properties, if first parity check node (Node k+ 1) it is damaged, need to appoint from remaining n-1 node and take k node, each node stores 2m data packet, repairs first odd even Check-node needs 2mk data packet；If repairing other parity check nodes L, L ∈ { k+2 ..., k+r }, repair and r and m Value it is related, as r=2, storage order is downloaded from each system node as in the data packet and each system node of odd number The last one data packet of storage, also needs to read and downloads the 3rd of node k+1, the 5th, the 2m-1 data guarantee the repair free of charge answer by Damage node；As r >=3, the data packet { q that storage order is odd number is downloaded from each system nodei, i={ 1 ..., k } and The last one data packet and reading f stored in each system node1, f2∈ { k+1 ..., k+r } in L storage order be even Several data packets repairs all information bits of malfunctioning node, wherein, m is arbitrary positive integer, and f represents its of removing malfunctioning node His parity check node.
CN201711362733.XA 2017-12-15 2017-12-15 Node repairing method and system for reducing storage overhead and improving repairing efficiency Active CN108199720B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711362733.XA CN108199720B (en) 2017-12-15 2017-12-15 Node repairing method and system for reducing storage overhead and improving repairing efficiency

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711362733.XA CN108199720B (en) 2017-12-15 2017-12-15 Node repairing method and system for reducing storage overhead and improving repairing efficiency

Publications (2)

Publication Number Publication Date
CN108199720A true CN108199720A (en) 2018-06-22
CN108199720B CN108199720B (en) 2021-02-19

Family

ID=62574493

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711362733.XA Active CN108199720B (en) 2017-12-15 2017-12-15 Node repairing method and system for reducing storage overhead and improving repairing efficiency

Country Status (1)

Country Link
CN (1) CN108199720B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109445990A (en) * 2018-10-29 2019-03-08 哈尔滨工业大学（深圳） MDS buffering scheme based on double rendition
CN110168505A (en) * 2018-07-10 2019-08-23 深圳花儿数据技术有限公司 The data recovery method and storage medium of distributed memory system

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103688515A (en) * 2013-03-26 2014-03-26 北京大学深圳研究生院 Method for encoding minimum bandwidth regeneration codes and repairing storage nodes
CN103688514A (en) * 2013-02-26 2014-03-26 北京大学深圳研究生院 Coding method for minimum storage regeneration codes and method for restoring of storage nodes
US20170083603A1 (en) * 2015-09-18 2017-03-23 Qualcomm Incorporated Co-derived data storage patterns for distributed storage systems
CN106776129A (en) * 2016-12-01 2017-05-31 陕西尚品信息科技有限公司 A kind of restorative procedure of the multinode data file based on minimum memory regeneration code
CN106790408A (en) * 2016-11-29 2017-05-31 中国空间技术研究院 A kind of coding method repaired for distributed memory system node
CN107086870A (en) * 2017-03-16 2017-08-22 东莞理工学院 Repair the MDS array codes coding and coding/decoding method of more piece point failure

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103688514A (en) * 2013-02-26 2014-03-26 北京大学深圳研究生院 Coding method for minimum storage regeneration codes and method for restoring of storage nodes
CN103688515A (en) * 2013-03-26 2014-03-26 北京大学深圳研究生院 Method for encoding minimum bandwidth regeneration codes and repairing storage nodes
US20170083603A1 (en) * 2015-09-18 2017-03-23 Qualcomm Incorporated Co-derived data storage patterns for distributed storage systems
CN106790408A (en) * 2016-11-29 2017-05-31 中国空间技术研究院 A kind of coding method repaired for distributed memory system node
CN106776129A (en) * 2016-12-01 2017-05-31 陕西尚品信息科技有限公司 A kind of restorative procedure of the multinode data file based on minimum memory regeneration code
CN107086870A (en) * 2017-03-16 2017-08-22 东莞理工学院 Repair the MDS array codes coding and coding/decoding method of more piece point failure

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
MARWEN ZORGUI 等: "Centralized multi-node repair in distributed storage", 《2016 54TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING》 *
XIAOHU TANG 等: "A New Repair Strategy for the Hadamard Minimum Storage Regenerating Codes for Distributed Storage Systems", 《IEEE TRANSACTIONS ON INFORMATION THEORY》 *
朱锐: "基于网络编码的分布式存储系统安全性研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *
范永骏 等: "低存储开销的二进制循环分布式存储编码设计", 《中国科技论文》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110168505A (en) * 2018-07-10 2019-08-23 深圳花儿数据技术有限公司 The data recovery method and storage medium of distributed memory system
WO2020010504A1 (en) * 2018-07-10 2020-01-16 深圳花儿数据技术有限公司 Data repair method for distributed storage system, and storage medium
CN110168505B (en) * 2018-07-10 2022-10-21 深圳花儿数据技术有限公司 Data repair method of distributed storage system and storage medium
CN109445990A (en) * 2018-10-29 2019-03-08 哈尔滨工业大学（深圳） MDS buffering scheme based on double rendition

Also Published As

Publication number Publication date
CN108199720B (en) 2021-02-19

Similar Documents

Publication Publication Date Title
CN103124182B (en) File download and streaming system
US9722637B2 (en) Construction of MBR (minimum bandwidth regenerating) codes and a method to repair the storage nodes
CN105356968B (en) The method and system of network code based on cyclic permutation matrices
EP2357731A1 (en) Systematic encoding and decoding of chain reaction codes
Sung et al. A ZigZag-decodable code with the MDS property for distributed storage systems
CN111078460B (en) Fast erasure code calculation method
CN105260259A (en) System minimum storage regeneration code based local repair encoding method
CN105356892B (en) The method and system of network code
WO2012008921A9 (en) Data encoding methods, data decoding methods, data reconstruction methods, data encoding devices, data decoding devices, and data reconstruction devices
CN108762978B (en) Grouping construction method of local part repeated cyclic code
CN106788891A (en) A kind of optimal partial suitable for distributed storage repairs code constructing method
CN112000512A (en) Data restoration method and related device
CN108199720A (en) A kind of node restorative procedure and system for reducing storage overhead and improving remediation efficiency
CN113258936B (en) Dual coding construction method based on cyclic shift
US10187084B2 (en) Method of encoding data and data storage system
CN108628697B (en) Binary-based node repairing method and system
CN104782101A (en) Encoding, reconstructing, and recovering methods used for self-repairing code stored by distributed network
CN109257049B (en) Construction method for repairing binary array code check matrix and repairing method
CN110781024B (en) Matrix construction method of symmetrical partial repetition code and fault node repairing method
CN109521955B (en) Heterogeneous part repeated code construction and conversion method based on hierarchical cross design
CN108536555B (en) Data access method based on BCube (n, b) data center
WO2017041232A1 (en) Encoding and decoding framework for binary cyclic code
CN111447044A (en) Distributed storage method and transmission decoding method
CN113258938B (en) Construction method for rapidly repairing erasure codes in single-node fault
WO2020029417A1 (en) Method for encoding and framing binary mds array code

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20180622

Assignee: Shenzhen Yunchuang Netcom Information Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047247

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231116

Application publication date: 20180622

Assignee: Yuncheng Holding (Shenzhen) Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047231

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231116

Application publication date: 20180622

Assignee: Shenzhen Suowei Information Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047180

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231115

Application publication date: 20180622

Assignee: Sankexiaocao (Shenzhen) Internet of Things Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047154

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231115

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20180622

Assignee: Shenzhen Kaixin Intelligent Control Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048385

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231124

Application publication date: 20180622

Assignee: SHENZHEN RED BANNER ELECTRICIAN TECHNOLOGY Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048064

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231123

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20180622

Assignee: SHENZHEN MAGIC-RAY TECHNOLOGY Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048336

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231127

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20180622

Assignee: Shenzhen Shenfeituo Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049530

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231201

Application publication date: 20180622

Assignee: Three Star Technology Media (Shenzhen) Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049519

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231201

Application publication date: 20180622

Assignee: HEIFENG ZHIZAO (SHENZHEN) TECHNOLOGY Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049506

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231201

Application publication date: 20180622

Assignee: Shenzhen jiafengmei Electronic Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049503

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231201

Application publication date: 20180622

Assignee: Shenzhen jinqihui Electric Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049502

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231201

Application publication date: 20180622

Assignee: Shenzhen Jinjia Group Co.,Ltd. Production and Marketing Branch

Assignor: SHENZHEN University

Contract record no.: X2023980049500

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231201

Application publication date: 20180622

Assignee: Shenzhen Cleon Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049498

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231201

Application publication date: 20180622

Assignee: Shenzhen Coco Future Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049496

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231201

Application publication date: 20180622

Assignee: Shenzhen Meishi Meike Intelligent Electrical Appliance Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049492

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231201

Application publication date: 20180622

Assignee: Niuniu Digital Technology (Shenzhen) Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049491

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231201

Application publication date: 20180622

Assignee: Communication Infinite Software Technology (Shenzhen) Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049243

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231130

Application publication date: 20180622

Assignee: Shenzhen Gaoxing Project Management Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049237

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231130

Application publication date: 20180622

Assignee: SHENZHEN FOXWELL TECHNOLOGY Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049220

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231130

Application publication date: 20180622

Assignee: Shenzhen Fanjian Cultural Industry Development Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049211

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231130

Application publication date: 20180622

Assignee: SHENZHEN CHUANGJIN XIN TECHNOLOGY Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049183

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231130

Application publication date: 20180622

Assignee: Shenzhen Bochuangsheng Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049164

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231130

Application publication date: 20180622

Assignee: SHENZHEN BAORUISI TECHNOLOGY CO.,LTD.

Assignor: SHENZHEN University

Contract record no.: X2023980049154

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231130

EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20180622

Assignee: Shenzhen pafick denture Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980050236

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231205

Application publication date: 20180622

Assignee: JIUZHOU YANGGUANG POWER SUPPLY (SHENZHEN) CO.,LTD.

Assignor: SHENZHEN University

Contract record no.: X2023980050235

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231206

Application publication date: 20180622

Assignee: Shenzhen Outstanding Intelligent Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980050231

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231205

Application publication date: 20180622

Assignee: Shenzhen Huike Energy Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980050230

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231206

Application publication date: 20180622

Assignee: Shenzhen Huike Storage Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980050228

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231205

Application publication date: 20180622

Assignee: Shenzhen Runheng Zhicheng Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049905

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231205

Application publication date: 20180622

Assignee: SHENZHEN XINHAO PHOTOELECTRIC TECHNOLOGY CO.,LTD.

Assignor: SHENZHEN University

Contract record no.: X2023980049900

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231204

Application publication date: 20180622

Assignee: Shenzhen Yaojiamei Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049898

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231205

Application publication date: 20180622

Assignee: Yimei Smart Technology (Shenzhen) Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049896

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231204

Application publication date: 20180622

Assignee: Shenzhen Yichen Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049893

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231204

Application publication date: 20180622

Assignee: Shenzhen yingshida Electromechanical Technology Development Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049892

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231204

Application publication date: 20180622

Assignee: SHENZHEN TECHWIN PRECISION MACHINERY Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049885

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231204

Application publication date: 20180622

Assignee: SHENZHEN ZHUO MAO TECHNOLOGY Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049882

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231204

Application publication date: 20180622

Assignee: Shenzhen Zheshang Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049880

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231204

Application publication date: 20180622

Assignee: Shenzhen Huishi Enterprise Service Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049876

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231204

Application publication date: 20180622

Assignee: Shenzhen Sanrenxing Media Advertising Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049874

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231204

Application publication date: 20180622

Assignee: SHENZHEN SANKATEC TECHNOLOGY CO.,LTD.

Assignor: SHENZHEN University

Contract record no.: X2023980049870

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231204

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20180622

Assignee: SHENZHEN NEW PERFECT DENTAL LABS CO.,LTD.

Assignor: SHENZHEN University

Contract record no.: X2023980051154

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231208

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20180622

Assignee: Tianhua (Shenzhen) communication technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980051414

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231211

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20180622

Assignee: SHENZHEN NIKTO TAPE NEW MATERIAL CO.,LTD.

Assignor: SHENZHEN University

Contract record no.: X2023980052471

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20231214

EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20180622

Assignee: Luoding Zhongda Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2024980000187

Denomination of invention: A node repair method and system for reducing storage overhead and improving repair efficiency

Granted publication date: 20210219

License type: Common License

Record date: 20240105

EE01 Entry into force of recordation of patent licensing contract