English
Related papers

Related papers: Self-Repairing Disk Arrays

200 papers

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

Distributed storage systems in the presence of a wiretapper are considered. A distributed storage system (DSS) is parameterized by three parameters (n, k,d), in which a file stored across n distributed nodes, can be recovered from any k out…

Information Theory · Computer Science 2016-11-17 Ravi Tandon , SaiDhiraj Amuru , T. Charles Clancy , R. Michael Buehrer

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

We consider the probability of data loss, or equivalently, the reliability function for an erasure coded distributed data storage system under worst case conditions. Data loss in an erasure coded system depends on probability distributions…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-18 Antonio Campello , Vinay A. Vaishampayan

The {\em repair locality} of a distributed storage code is the maximum number of nodes that ever needs to be contacted during the repair of a failed node. Having small repair locality is desirable, since it is proportional to the number of…

Information Theory · Computer Science 2013-01-21 Henk D. L. Hollmann

In a distributed storage system based on erasure coding, an important problem is the \emph{repair problem}: If a node storing a coded piece fails, in order to maintain the same level of reliability, we need to create a new encoded piece and…

Information Theory · Computer Science 2016-11-17 Yunnan Wu

Data redundancy techniques have been tested in several different applications to provide fault tolerance and performance gains. The use of these techniques is mostly seen at the hardware, device driver, or file system level. In practice,…

Cryptography and Security · Computer Science 2026-04-07 Ahmed Sharuvan , Ahmed Naufal Abdul Hadee

Binary maximum distance separable (MDS) array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundancy but also achieve low computational complexity. They are…

Information Theory · Computer Science 2019-06-24 Hanxu Hou , Yunghsiang Han , Patrick P. C. Lee , Yuchong Hu , Hui Li

One of the most important parts of cloud computing is storage devices, and Redundant Array of Independent Disks (RAID) systems are well known and frequently used storage devices. With the increasing production of data in cloud environments,…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-04-06 Leila Namvari-Tazehkand , Saeid Pashazadeh

Solid-state drives (SSDs) have been widely deployed in desktops and data centers. However, SSDs suffer from bit errors, and the bit error rate is time dependent since it increases as an SSD wears down. Traditional storage systems mainly use…

Performance · Computer Science 2013-04-09 Yongkun Li , Patrick P. C. Lee , John C. S. Lui

This paper generalizes the piggybacking constructions for distributed storage systems by considering various protected instances and piggybacked instances. Analysis demonstrates that the proportion of protected instances determines the…

Information Theory · Computer Science 2017-02-07 Shuai Yuan , Qin Huang , Zulin Wang

Magnetic tapes are often considered as an outdated storage technology, yet they are still used to store huge amounts of data. Their main interests are a large capacity and a low price per gigabyte, which come at the cost of a much larger…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-05 Valentin Honoré , Bertrand Simon , Frédéric Suter

We study the repair problem of distributed storage systems in erasure networks where the packets transmitted from surviving nodes to the new node might be lost. The fundamental storage-bandwidth tradeoff is calculated by multicasting…

Information Theory · Computer Science 2013-01-30 Majid Gerami , Ming Xiao

In a distributed storage system, the storage costs of different storage nodes, in general, can be different. How to store a file in a given set of storage nodes so as to minimize the total storage cost is investigated. By analyzing the…

Information Theory · Computer Science 2011-07-29 Quan Yu , Kenneth W. Shum , Chi Wan Sung

In this paper, we introduce a model of a distributed storage system that is locally recoverable from any single server failure. Unlike the usual local recovery model of codes for distributed storage, this model accounts for the fact that…

Information Theory · Computer Science 2020-07-01 Arya Mazumdar

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

To help reliability of SSD arrays, Redundant Array of Independent Disks (RAID) are commonly employed. However, the conventional reliability models of HDD RAID cannot be applied to SSD arrays, as the nature of failures in SSDs are different…

Performance · Computer Science 2021-12-24 Mostafa Kishani , Saba Ahmadian , Hossein Asadi

Distributed storage systems are mainly justified due to the limited amount of storage capacity and improving the reliability through distributing data over multiple storage nodes. On the other hand, it may happen the data is stored in…

Information Theory · Computer Science 2010-04-15 Soroush Akhlaghi , Abbas Kiani , Mohammad Reza Ghanavati

Distributed storage systems employ codes to provide resilience to failure of multiple storage disks. Specifically, an $(n, k)$ MDS code stores $k$ symbols in $n$ disks such that the overall system is tolerant to a failure of up to $n-k$…

Information Theory · Computer Science 2013-05-16 Sreechakra Goparaju , Itzhak Tamo , Robert Calderbank

SD codes are erasure codes that address the mixed failure mode of current RAID systems. Rather than dedicate entire disks to erasure coding, as done in RAID-5, RAID-6 and Reed-Solomon coding, an SD code dedicates entire disks, plus…

Information Theory · Computer Science 2013-05-07 Mario Blaum , James S. Plank