XOR Erasure Coding for Two-Node Failure Recovery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing erasure code methods cannot generate two verification data using exclusive OR operations, making it difficult to restore data when two storage nodes are damaged.
Innovation Solution
The method involves splitting original data into blocks, performing transverse and longitudinal exclusive OR operations to create encoding matrices, and rearranging data for efficient storage and recovery, allowing for the generation of two verification data using exclusive OR operations when two storage nodes are damaged.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional erasure code algorithms use matrix multiplication, then data redundancy protection is achieved, but calculation complexity increases and operation becomes heavy
Solution Approach 1:
The patent changes the operational parameters of the erasure code algorithm from general matrix multiplication to specific exclusive OR operations. By transforming the calculation paradigm and utilizing properties of exclusive OR operations, the system achieves the same data protection reliability with significantly reduced computational complexity, making it suitable for distributed storage systems.
Solution Approach 2:
The patent substitutes the traditional matrix multiplication mechanism with an exclusive OR operation mechanism. This replacement transforms a computationally intensive operation into a simpler bitwise operation that is easier to implement in hardware and software, thereby reducing calculation complexity while maintaining data redundancy protection capabilities.
2Ease of operation
If exclusive OR operations are used for verification data calculation, then operation simplicity and hardware realization ease improve, but only one verification data can be produced when m>1
Solution Approach 1:
The patent segments the verification data generation process into multiple independent exclusive OR operations. Instead of producing a single verification value, the system performs multiple segmentation-based exclusive OR operations on different data blocks, generating multiple verification data values (m values) that can protect against multiple node failures while maintaining operation simplicity.
Solution Approach 2:
The patent extends the exclusive OR operation from a single-dimensional calculation to a multi-dimensional structure by organizing data blocks and verification values in a matrix format. This dimensional expansion allows multiple verification data values to be generated through systematic exclusive OR operations across different rows and columns, thereby enhancing reliability without sacrificing operational simplicity.
3Reliability
If matrix multiplication is used for erasure coding, then comprehensive data protection is achieved, but calculation hardware conversion becomes difficult
Solution Approach 1:
The patent substitutes matrix multiplication with exclusive OR operations, which are natively supported by hardware bitwise operation units. This substitution makes the erasure coding algorithm much more amenable to hardware implementation, as exclusive OR operations can be executed efficiently using standard digital logic circuits and processor bitwise instructions, thereby easing hardware conversion and deployment.
4Reliability
If traditional redundancy protection technology is used, then data reliability is maintained, but disk utilization rate decreases
Solution Approach 1:
The patent changes the redundancy parameter structure by using exclusive OR operations to generate verification data with optimized redundancy ratios. This approach allows for more efficient space utilization compared to traditional copying methods, as the verification data generated through exclusive OR operations provides comprehensive protection with fewer redundant blocks, thereby improving disk utilization rate while maintaining data reliability.
Data Source
AI summary
The present invention discloses an erasure code calculation method, including the following steps: S1) splitting original data, and building an original encoding matrix M; S2) acquiring a transverse exclusive OR encoding matrix M1; S3) acquiring a longitudinal exclusive OR encoding matrix M2; S4) acquiring an exclusive OR encoding matrix M3 according to the transverse exclusive OR encoding matrix M1 and the longitudinal exclusive OR encoding matrix M2; S5) transforming a data position of the transverse exclusive OR encoding matrix M1 to acquire a storage matrix M4; S6) judging whether storage nodes at which the last column of data of the storage matrix M4 is stored are damaged; S7) restoring the lost data according to a position 1 of the damaged node; and S8) restoring the lost data according to a position 2 of the damaged node. In the present invention, the operation is rapid, and calculation efficiency is high.