English
Related papers

Related papers: RapidRAID: Pipelined Erasure Codes for Fast Data A…

200 papers

Erasure coding techniques are getting integrated in networked distributed storage systems as a way to provide fault-tolerance at the cost of less storage overhead than traditional replication. Redundancy is maintained over time through…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-06-12 Lluis Pamies-Juarez , Frédérique Oggier , Anwitaman Datta

Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer increased resilience in the presence of node failures. The…

Information Theory · Computer Science 2016-11-17 K. V. Rashmi , Nihar B. Shah , P. Vijay Kumar

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

In a distributed storage system, code symbols are dispersed across space in nodes or storage units as opposed to time. In settings such as that of a large data center, an important consideration is the efficient repair of a failed node.…

Information Theory · Computer Science 2018-06-13 S. B. Balaji , M. Nikhil Krishnan , Myna Vajha , Vinayak Ramkumar , Birenjith Sasidharan , P. Vijay Kumar

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

We propose repair pipelining, a technique that speeds up the repair performance in general erasure-coded storage. By carefully scheduling the repair of failed data in small-size units across storage nodes in a pipelined manner, repair…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-11-23 Xiaolu Li , Zuoru Yang , Jinhong Li , Runhui Li , Patrick P. C. Lee , Qun Huang , Yuchong Hu

Peer-to-peer distributed storage systems provide reliable access to data through redundancy spread over nodes across the Internet. A key goal is to minimize the amount of bandwidth used to maintain that redundancy. Storing a file using an…

Information Theory · Computer Science 2007-07-13 Alexandros G. Dimakis , P. Brighten Godfrey , Martin J. Wainwright , Kannan Ramchandran

Erasure codes are an integral part of many distributed storage systems aimed at Big Data, since they provide high fault-tolerance for low overheads. However, traditional erasure codes are inefficient on reading stored data in degraded…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-06-27 Kyumars Sheykh Esmaili , Lluis Pamies-Juarez , Anwitaman Datta

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

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

Classical erasure codes, e.g. Reed-Solomon codes, have been acknowledged as an efficient alternative to plain replication to reduce the storage overhead in reliable distributed storage systems. Yet, such codes experience high overhead…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-06-20 Anne-Marie Kermarrec , Erwan Le Merrer , Gilles Straub , Alexandre van Kempen

Distributed storage systems support failures of individual devices by the use of replication or erasure correcting codes. While erasure correcting codes offer a better storage efficiency than replication for similar fault tolerance, they…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-12-10 Nicolas Le Scouarnec

We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes with limited memory and k<n sources generating the data. We…

Information Theory · Computer Science 2016-11-15 Alexandros G. Dimakis , Vinod Prabhakaran , Kannan Ramchandran

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

Erasure codes have been widely considered a promising solution to enhance data reliability at low storage costs. However, in modern geo-distributed storage systems, erasure codes may incur high data access latency as they require data…

Information Theory · Computer Science 2020-12-08 Kaiyang Liu , Jun Peng , Jingrong Wang , Jianping Pan

Network codes designed specifically for distributed storage systems have the potential to provide dramatically higher storage efficiency for the same availability. One main challenge in the design of such codes is the exact repair problem:…

Information Theory · Computer Science 2011-09-02 Dimitris S. Papailiopoulos , Jianqiang Luo , Alexandros G. Dimakis , Cheng Huang , Jin Li

The continuously increasing amount of digital data generated by today's society asks for better storage solutions. This survey looks at a new generation of coding techniques designed specifically for the needs of distributed networked…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-01-31 Anwitaman Datta , Frederique Oggier

Distributed data storage systems are essential to deal with the need to store massive volumes of data. In order to make such a system fault-tolerant, some form of redundancy becomes crucial, incurring various overheads - most prominently in…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-12-25 Frederique Oggier , Anwitaman Datta

Reliability in distributed storage systems has typically focused on the design and deployment of data replication or erasure coding techniques. Although some scenarios have considered the use of replication for hot data and erasure coding…

Information Theory · Computer Science 2025-11-04 Daniel E. Lucani , Marcell Fehér
‹ Prev 1 2 3 10 Next ›