| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949575 | Discrete Applied Mathematics | 2017 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Shuhong Gao, Fiona Knoll, Felice Manganiello, Gretchen Matthews,