Abstract:
In practical distributed storage networks, data centres house hundreds of racks, each of which contains several storage nodes. However, the majority of works in distribut...Show MoreMetadata
Abstract:
In practical distributed storage networks, data centres house hundreds of racks, each of which contains several storage nodes. However, the majority of works in distributed storage assume a simple network model with a collection of identical storage nodes with same communication cost between the nodes. In this paper, we consider a more realistic rack model of storage network and present a code design framework for this model. Using our code construction method, node failures within a rack can be repaired locally by survived nodes in the same rack or by the other survived racks when the information content of the same rack is not sufficient to repair the failed nodes.
Published in: 2014 IEEE Information Theory Workshop (ITW 2014)
Date of Conference: 02-05 November 2014
Date Added to IEEE Xplore: 04 December 2014
Electronic ISBN:978-1-4799-5999-0
Print ISSN: 1662-9019