Paper Info
Title
Codes for distributed storage from 3-regular graphs.
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.
Year
DOI
Venue
2017
10.1016/j.dam.2017.04.014
Discrete Applied Mathematics
Keywords
DocType
Volume
Distributed storage systems,3-regular graphs,4-regular graph,P4 paths,Decomposition of 3-regular graphs,Linear codes from graphs
Journal
229
ISSN
Citations 
PageRank 
0166-218X
0
0.34
References 
Authors
7
4
Name
Order
Citations
PageRank
Shuhong Gao146947.50
Fiona Knoll200.34
Felice Manganiello3165.09
Gretchen L. Matthews48113.47