Multi-Rack Distributed Data Storage Networks
Preprint
Abstract
The majority of works in distributed storage networks assume a simple network model with a collection of identical storage nodes with the same communication cost between the nodes. In this paper, we consider a realistic multi-rack distributed data storage network and present a code design framework for this model. Considering the cheaper data transmission within the racks, our code construction method is able to locally repair the nodes failure within the same rack by using only the survived nodes in the same rack. However, in the case of severe failure patterns when the information content of the survived nodes is not sufficient to repair the failures, other racks will participate in the repair process. By employing the criteria of our multi-rack storage code, we establish a linear programming bound on the size of the code in order to maximize the code rate.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Capacity and Security of Heterogeneous Distributed Storage SystemsIEEE Journal on Selected Areas in Communications, 2013
- Locally repairable codes with multiple repair alternatives2013
- Simple regenerating codes: Network coding for cloud storage2012
- Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth TradeoffIEEE Transactions on Information Theory, 2011
- Repair optimal erasure codes through hadamard designs2011
- Exact-Repair MDS Code Construction Using Interference AlignmentIEEE Transactions on Information Theory, 2011
- Cost-bandwidth tradeoff in distributed storage systemsComputer Communications, 2010
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010
- Explicit construction of optimal exact regenerating codes for distributed storage2009
- Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems2007