English
Related papers

Related papers: Redundancy and Aging of Efficient Multidimensional…

200 papers

Accessing the data in the failed disk (degraded read) with low latency is crucial for an erasure-coded storage system. In this work, the maximum distance separable (MDS) array code with the property of degraded-read friendly (DRF) is…

Information Theory · Computer Science 2021-02-05 Ting-Yi Wu , Yunghsiang S. Han , Zhengrui Li , Bo Bai , Gong Zhang , Liang Chen , Xiang Wu

In large-scale distributed storage systems (DSS), reliability is provided by redundancy spread over storage servers across the Internet. Network coding (NC) has been widely studied in DSS because it can improve the reliability with low…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-11-17 Chengjin Jia , Jin Wang , Yanqin Zhu , Xin Wang , Kejie Lu , Xiumin Wang , Zhengqing Wen

In \textit{Distributed Storage Systems} (DSSs), usually, data is stored using replicated packets on different chunk servers. Recently a new paradigm of \textit{Fractional Repetition} (FR) codes have been introduced, in which, data is…

Information Theory · Computer Science 2017-11-27 Krishna Gopal Benerjee , Manish K Gupta

A message composed of packets is transmitted using erasure and channel coding over a fading channel with no feedback. For this scenario, the paper explores the trade-off between the redundancies allocated to the packet-level erasure code…

Information Theory · Computer Science 2016-02-03 Sudarsan V. S. Ranganathan , Tong Mu , Richard D. Wesel

In order to provide high data reliability, distributed storage systems disperse data with redundancy to multiple storage nodes. Regenerating codes is a new class of erasure codes to introduce redundancy for the purpose of improving the data…

Information Theory · Computer Science 2015-03-18 Kenneth W. Shum , Yuchong Hu

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

As consumers are increasingly engaged in social networking and E-commerce activities, businesses grow to rely on Big Data analytics for intelligence, and traditional IT infrastructures continue to migrate to the cloud and edge, these trends…

Networking and Internet Architecture · Computer Science 2020-05-25 Vaneet Aggarwal , Tian Lan

A passive adversary can eavesdrop stored content or downloaded content of some storage nodes, in order to learn illegally about the file stored across a distributed storage system (DSS). Previous work in the literature focuses on code…

Information Theory · Computer Science 2014-02-19 Son Hoang Dau , Wentu Song , Chau Yuen

Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-peer storage systems, and storage in wireless networks. Storing…

Networking and Internet Architecture · Computer Science 2008-03-06 Alexandros G. Dimakis , P. Brighten Godfrey , Yunnan Wu , Martin J. Wainwright , Kannan Ramchandran

Repair operations in distributed storage systems potentially expose the data to malicious acts of passive eavesdroppers or active adversaries, which can be detrimental to the security of the system. This paper presents erasure codes and…

Information Theory · Computer Science 2015-08-18 Nihar B. Shah , K. V. Rashmi , Kannan Ramchandran , P. Vijay Kumar

Distributed storage systems (DSSs) have gained a lot of interest recently, thanks to their robustness and scalability compared to single-device storage. Majority of the related research has exclusively concerned the network layer. At the…

Information Theory · Computer Science 2014-04-29 Camilla Hollanti , David Karpuk , Amaro Barreal , Hsiao-feng Francis Lu

The amount of digital data is rapidly growing. There is an increasing use of a wide range of computer systems, from mobile devices to large-scale data centers, and important for reliable operation of all computer systems is mitigating the…

Information Theory · Computer Science 2018-03-06 Katina Kralevska

This work presents a theoretical analysis of the probability of successfully retrieving data encoded with MDS codes (e.g., Reed-Solomon codes) in DNA storage systems. We study this probability under independent and identically distributed…

Information Theory · Computer Science 2026-05-08 Serge Kas Hanna

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

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

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

Erasure coding is a storage-efficient alternative to replication for achieving reliable data backup in distributed storage systems. During the storage process, traditional erasure codes require a unique source node to create and upload all…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-03-19 Lluis Pamies-Juarez , Anwitaman Datta , Frédérique Oggier

Maximum distance separable (MDS) codes are widely used in storage systems to protect against disk (node) failures. A node is said to have capacity $l$ over some field $\mathbb{F}$, if it can store that amount of symbols of the field. An…

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

Distributed storage systems often introduce redundancy to increase reliability. When coding is used, the repair problem arises: if a node storing encoded information fails, in order to maintain the same level of reliability we need to…

Information Theory · Computer Science 2010-04-27 Alexandros G. Dimakis , Kannan Ramchandran , Yunnan Wu , Changho Suh

Regenerating codes enable trading off repair bandwidth for storage in distributed storage systems (DSS). Due to their distributed nature, these systems are intrinsically susceptible to attacks, and they may also be subject to multiple…

Information Theory · Computer Science 2014-07-10 O. Ozan Koyluoglu , Ankit Singh Rawat , Sriram Vishwanath