English
Related papers

Related papers: Optimal Repair of MDS Codes in Distributed Storage…

200 papers

This paper aims to go beyond resilience into the study of security and local-repairability for distributed storage systems (DSS). Security and local-repairability are both important as features of an efficient storage system, and this paper…

Information Theory · Computer Science 2016-11-17 Ankit Singh Rawat , O. Ozan Koyluoglu , Natalia Silberstein , Sriram Vishwanath

Partial-MDS (PMDS) codes are a family of locally repairable codes, mainly used for distributed storage. They are defined to be able to correct any pattern of $s$ additional erasures, after a given number of erasures per locality group have…

Information Theory · Computer Science 2017-07-05 Anna-Lena Horlemann-Trautmann , Alessandro Neri

The minimum storage rack-aware regenerating (MSRR) code is a variation of regenerating codes that achieves the optimal repair bandwidth for a single node failure in the rack-aware model. The authors in~\cite{Chen-Barg2019}…

Information Theory · Computer Science 2021-09-20 Jiaojiao Wang , Dabin Zheng , Shenghua Li

In distributed storage systems reliability is achieved through redundancy stored at different nodes in the network. Then a data collector can reconstruct source information even though some nodes fail. To maintain reliability, an autonomous…

Information Theory · Computer Science 2013-03-26 Majid Gerami , Ming Xiao , Mikael Skoglund , Kenneth W. Shum , Dengsheng Lin

Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure correcting codes that combine locality with strong erasure correction capabilities. We construct PMDS and SD codes with local regeneration where each local code is a…

Information Theory · Computer Science 2021-06-14 Lukas Holzbaur , Sven Puchinger , Eitan Yaakobi , Antonia Wachter-Zeh

Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e., codes that minimize the total repair bandwidth; and codes…

In distributed storage systems (DSSs), the optimal tradeoff between node storage and repair bandwidth is an important issue for designing distributed coding strategies to ensure large scale data reliability. The capacity of DSSs is obtained…

Information Theory · Computer Science 2019-01-11 Jingzhao Wang , Tinghan Wang , Yuan Luo , Kenneth W. Shum

Modern distributed storage systems apply redundancy coding techniques to stored data. One form of redundancy is based on regenerating codes, which can minimize the repair bandwidth, i.e., the amount of data transferred when repairing a…

Information Theory · Computer Science 2013-01-23 Yuchong Hu , Patrick P. C. Lee , Kenneth W. Shum

Erasure codes are being increasingly used in distributed-storage systems in place of data-replication, since they provide the same level of reliability with much lower storage overhead. We consider the problem of constructing explicit…

Information Theory · Computer Science 2015-09-08 Preetum Nakkiran , K. V. Rashmi , Kannan Ramchandran

MDS array codes are widely used in storage systems to protect data against erasures. We address the \emph{rebuilding ratio} problem, namely, in the case of erasures, what is the fraction of the remaining information that needs to be…

Information Theory · Computer Science 2016-11-17 Itzhak Tamo , Zhiying Wang , Jehoshua Bruck

Erasure correcting codes are widely used to ensure data persistence in distributed storage systems. This paper addresses the simultaneous repair of multiple failures in such codes. We go beyond existing work (i.e., regenerating codes by…

Information Theory · Computer Science 2013-09-18 Anne-Marie Kermarrec , Gilles Straub , Nicolas Le Scouarnec

The newly presented $(k+2,k)$ Hadamard minimum storage regenerating (MSR) code is the first class of high rate storage code with optimal repair property for all single node failures. In this paper, we propose a new simple repair strategy,…

Information Theory · Computer Science 2013-12-19 Xiaohu Tang , Bin Yang , Jie Li

Several works have developed vector-linear maximum-distance separable (MDS) storage codes that min- imize the total communication cost required to repair a single coded symbol after an erasure, referred to as repair bandwidth (BW). Vector…

Information Theory · Computer Science 2016-11-18 Karthikeyan Shanmugam , Dimitris S. Papailiopoulos , Alexandros G. Dimakis , Giuseppe Caire

We consider the decoding of linear and array codes from errors when we are only allowed to download a part of the codeword. More specifically, suppose that we have encoded $k$ data symbols using an $(n,k)$ code with code length $n$ and…

Information Theory · Computer Science 2018-10-10 Itzhak Tamo , Min Ye , Alexander Barg

Piggybacking is an efficient method to decrease the repair bandwidth of Maximum Distance Separable (MDS) codes or Minimum Storage Regenerating (MSR) codes. In this paper, for minimizing the repair bandwidth of parity nodes of the known MSR…

Information Theory · Computer Science 2014-08-26 Bin Yang , Xiaohu Tang , Jie Li

Most large-scale storage systems employ erasure coding to provide resilience against disk failures. Recent work has shown that tuning this redundancy to changes in disk failure rates leads to substantial storage savings. This process…

Information Theory · Computer Science 2024-05-16 Saransh Chopra , Francisco Maturana , K. V. Rashmi

Centralized repair refers to repairing $h\geq 2$ node failures using $d$ helper nodes in a centralized way, where the repair bandwidth is counted by the total amount of data downloaded from the helper nodes. A centralized MSR code is an MDS…

Information Theory · Computer Science 2024-02-06 Yaqian Zhang

Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. Also of interest is minimization of the bandwidth required to repair the system following a node failure. In a…

Information Theory · Computer Science 2009-10-06 K. V. Rashmi , Nihar B. Shah , P. Vijay Kumar , Kannan Ramchandran

As storage systems grow in size, device failures happen more frequently than ever before. Given the commodity nature of hard drives employed, a storage system needs to tolerate a certain number of disk failures while maintaining data…

Information Theory · Computer Science 2014-05-20 Yan Wang , Xunrui Yin , Xin Wang

In a modern distributed storage system, storage nodes are organized in racks, and the cross-rack communication dominates the system bandwidth. In We study the rack-aware storage system where all storage nodes are organized in racks and…

Information Theory · Computer Science 2022-07-18 Liyang Zhou , Zhifang Zhang