Multi-Rack Distributed Data Storage Networks

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

7 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Article number8758384
Pages (from-to)6072-6088
Journal / PublicationIEEE Transactions on Information Theory
Volume65
Issue number10
Online published9 Jul 2019
Publication statusPublished - Oct 2019

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.

Research Area(s)

  • linear programming, Multi-rack storage network, repair process, symmetry

Citation Format(s)

Multi-Rack Distributed Data Storage Networks. / Tebbi, Ali; Chan, Terence H.; Sung, Chi Wan.

In: IEEE Transactions on Information Theory, Vol. 65, No. 10, 8758384, 10.2019, p. 6072-6088.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review