Self-Repairing Homomorphic Codes for Distributed Storage Systems
Source: Nanyang Technological University
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 need to recreate (or keep separately) first a copy of the whole object before any individual encoded fragment can be generated and replenished. There has been recently intense interest to explore alternatives, most prominent ones being Re Generating Codes (RGC) and Hierarchical Codes (HC).