Download now Free registration required
Distributed storage systems usually achieve fault tolerance by replicating data across different nodes. However, redundancy schemes based on erasure codes can provide a storage-efficient alternative to replication. This is particularly suited for data archival since archived data is rarely accessed. Typically, the migration to erasure-encoded storage does not leverage on the existing replication based redundancy, and simply discards (garbage collects) the excessive replicas. In this paper, the authors propose a new decentralized erasure coding process that achieves the migration in a network-efficient manner in contrast to the traditional coding processes.
- Format: PDF
- Size: 475.6 KB