@DSN'18 @ Redundancy Propagation
Alpha Entanglement Codes: Practical Erasure Codes to Archive Data in Unreliable EnvironmentsSummaryStrength (Contributions of the paper)Weakness (Limitations of the paper)Future Works
Motivation of this paper: this paper intends to design flexible and practical erasure codes with high fault-tolerance to improve data durability and availability even in catastrophic scenarios.
Alpha Entanglement Codes (AEC) : The idea of AE code is to create redundancy by tangling (mixing) new data and blocks with old ones, building entangled data chains that are woven into a growing mesh of interdependent content.
- : determine the local connectivity, the number of parities created per data block.
- amd : determin the global connectiviry of data blocks in the grid. defines the number of helical strands. the number of horizontal strands
Each node belongs to strands each edge belongs to only one strand.
The entanglement function computes the exclusive-or (XOR) of two consecutive blocks at the head of a strand and inserts the output adjacent to the last block.
Implementation and Evaluation: Implementation: It mentions two use cases of entangled storage system
- A Geo-Replicated Backup
- Disk Arrays
Evaluation: It examines the design of AE codes to understand how the code settings impact on fault tolerance and write performance.
- Code Parameters and Write Performance
- Code Parameters and Fault Tolerance