Codes for distributed storage from 3-regular graphs

TL;DR

This paper introduces a novel approach to distributed storage systems using 3-regular graphs and path decompositions, demonstrating their optimal properties through graph-theoretic analysis.

Contribution

It presents a new graph-theoretic construction of DSSs based on path decomposition of 3-regular graphs, showing their optimality.

Findings

DSSs constructed from 3-regular graphs are optimal.

Path decomposition into P4 paths effectively models storage disks.

Graph properties determine DSS efficiency and robustness.

Abstract

This paper considers distributed storage systems (DSSs) from a graph theoretic perspective. A DSS is constructed by means of the path decomposition of a 3- regular graph into P4 paths. The paths represent the disks of the DSS and the edges of the graph act as the blocks of storage. We deduce the properties of the DSS from a related graph and show their optimality.