Codes for distributed storage from 3-regular graphs Article Swipe
Related Concepts
Computer science
Graph
Distributed data store
Theoretical computer science
Distributed computing
Shuhong Gao
,
Fiona Knoll
,
Felice Manganiello
,
Gretchen L. Matthews
·
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1610.00043
· OA: W2952573685
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1610.00043
· OA: W2952573685
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.
Related Topics
Finding more related topics…