Download now Free registration required
Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-peer storage systems, and storage in wireless networks. Storing data using an erasure code, in fragments spread across nodes, requires less redundancy than simple replication for the same level of reliability. However, since fragments must be periodically replaced as nodes fail; a key question is how to generate encoded fragments in a distributed way while transferring as little data as possible across the network.
- Format: PDF
- Size: 258.2 KB