Self-repairing homomorphic codes for distributed storage systems
Erasure codes provide a storage efficient alternative to replication based redundancy in (networked) storage systems. They however entail high communication overhead for maintenance, when some of the encoded fragments are lost and need to be replenished. Such overheads arise from the fundamental nee...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Language: | English |
| Published: |
2011
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/91857 http://hdl.handle.net/10220/6760 |