Unlock instant, AI-driven research and patent intelligence for your innovation.

A Construction Method of Erasure Code for Fast Recovery of Single Node Fault

A single-node, erasure code technology, applied in the field of coding, can solve the problems of high repair cost, limited array size, large storage overhead, etc., achieve high fault tolerance and reduce the effect of repair bandwidth

Active Publication Date: 2021-10-08
CHENGDU UNIV OF INFORMATION TECH
View PDF17 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] 1) The verification data is multiple times that of the original data, the storage overhead is large, and the space utilization rate is low;
[0007] 2) When repairing a single node, it is necessary to read all node data, and the repair cost is high;
[0008] 3) The structure-based single-node error reconstruction is only valid for the standard form of encoding, so the universality is poor;
[0009] 4) The array code has limited fault tolerance, and the array size is strictly limited;
[0010] 5) Single-node repair based on block code, the repair cost is still high

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Construction Method of Erasure Code for Fast Recovery of Single Node Fault
  • A Construction Method of Erasure Code for Fast Recovery of Single Node Fault
  • A Construction Method of Erasure Code for Fast Recovery of Single Node Fault

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0084] The embodiment of the present invention includes an encoding process and a decoding process.

[0085] Encoding process:

[0086] The first step is to group nodes;

[0087]Divide x nodes into y groups, each group contains k original data nodes, each horizontal strip contains y groups, and each group contains k original data blocks. That is, if figure 2 As shown, 12 nodes are divided into 2 groups, and each group contains 6 original data nodes.

[0088] The second step is to divide the stripes;

[0089] Each node contains several data blocks (data blocks include original data blocks and check blocks), and the first data block in each node forms a stripe S 0 , the second data block in each node forms the stripe S 1 , the z-th data block in each node forms the stripe S z-1 , each horizontal stripe contains y groups, and each group contains k original data blocks. That is, if image 3 As shown, each node contains several data blocks, and the first data block in each...

example 2

[0123] The first step is to group nodes;

[0124] Divide 18 nodes into 2 groups, each group has 9 original data nodes.

[0125] The second step is to divide the stripes;

[0126] Each node contains several data blocks, and the first data block in each node forms a stripe S 0 , the second data block in each node forms the stripe S 1 , each horizontal stripe contains 2 groups, and each group contains 9 original data blocks.

[0127] The third step is to perform horizontal coding to obtain horizontal partial verification;

[0128] Each horizontal group is coded within the group, and the RS code is selected for coding. The coding equation: C=UG (Formula 1), and each group in each strip in the group is coded according to RS(9,3), and the 9 original The data block is encoded to generate three horizontal local check blocks.

[0129] The fourth step is to perform horizontal coding to obtain horizontal global verification;

[0130] In turn, the first horizontal ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method for constructing an erasure code for quick repair of single-node faults. , to ensure the fault-tolerant ability of the encoding; XOR encoding is verified in the vertical direction, so that the encoding has the ability to quickly repair a single node. When a single failed block occurs in a group, it can be repaired through the XOR check in the vertical direction, which can reduce the repair bandwidth; when multiple blocks fail in the group, it can be restored through the horizontal check to maintain a high fault tolerance.

Description

technical field [0001] The invention relates to the field of encoding technology, in particular to a method for constructing an erasure correction code for quick repair of a single node failure. Background technique [0002] With the continuous development of information technology in various industries and fields, the amount of data is showing an exponential growth trend. How to safely store massive data has become an urgent problem to be solved. The continuous increase in the amount of stored data has led to an increasing scale of distributed storage systems. Due to the geographical dispersion and network characteristics of distributed storage systems, it is also facing many software and hardware failures, virus attacks, and natural disasters. . These factors may cause multiple data nodes to fail, resulting in data loss. Therefore, how to securely store data and make data highly reliable and highly available has become an important issue in distributed secure storage at ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H03M13/15G06F11/10
CPCG06F11/1004H03M13/15
Inventor 唐聃耿微何磊刘敦龙何瑞刘龙祥
Owner CHENGDU UNIV OF INFORMATION TECH
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com