Data Repair System with Interleaver Obtained by Tessellation from the Graph of [7, 3, 4] Code

Abstract

This paper proposes and analyzes a distributed storage system with a scalable family of locally repairable codes with multiple repair alternatives (so called availability), constructed by tessellating a plain by the graph of the [7, 3, 4] simplex code. A similar system has been tested in simulations and its resilience to symbol losses was evaluated [1]. However, the results did not achieve the expected tolerance to server losses represented by erasures. Therefore, in this manuscript we present a modified system and its simulation tests. The main novelty is the implementation of interleaving in it. The simulation results prove that this modification can considerably improve the symbol erasure resilience.