English
Related papers

Related papers: An Overview of Codes Tailor-made for Better Repair…

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

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

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

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

Self-Repairing Codes (SRC) are codes designed to suit the need of coding for distributed networked storage: they not only allow stored data to be recovered even in the presence of node failures, they also provide a repair mechanism where as…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-05-03 Frederique Oggier , Anwitaman Datta

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

The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Yet, the codes being deployed in practice are fairly short. In this work, we address what we…

Information Theory · Computer Science 2016-09-22 Parikshit Gopalan , Guangda Hu , Swastik Kopparty , Shubhangi Saraf , Carol Wang , Sergey Yekhanin

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 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

Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address the fundamental problem of handling errors and erasures during…

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

A major issue of locally repairable codes is their robustness. If a local repair group is not able to perform the repair process, this will result in increasing the repair cost. Therefore, it is critical for a locally repairable code to…

Information Theory · Computer Science 2019-04-09 Ali Tebbi , Terence H. Chan , Chi Wan Sung

This chapter deals with the topic of designing reliable and efficient codes for the storage and retrieval of large quantities of data over storage devices that are prone to failure. For long, the traditional objective has been one of…

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

Distributed storage systems need to store data redundantly in order to provide some fault-tolerance and guarantee system reliability. Different coding techniques have been proposed to provide the required redundancy more efficiently than…

Information Theory · Computer Science 2016-11-15 Lluis Pamies-Juarez , Henk D. L. Hollmann , Frédérique Oggier

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

Erasure codes provide a storage efficient alternative to replication based redundancy in (networked) storage systems. They however entail high communication overhead for maintenance, when some of the encoded fragments are lost and need to…

Distributed, Parallel, and Cluster Computing · Computer Science 2010-11-24 Frederique Oggier , Anwitaman Datta

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

In coding for distributed storage systems, efficient data reconstruction and repair through accessing a predefined number of arbitrarily chosen storage nodes is guaranteed by regenerating codes. Traditionally, code parameters, specially the…

Information Theory · Computer Science 2018-01-01 Kaveh Mahdaviani , Soheil Mohajer , Ashish Khisti

Regenerating codes allow distributed storage systems to recover from the loss of a storage node while transmitting the minimum possible amount of data across the network. We present a systematic computer search for optimal systematic…

Information Theory · Computer Science 2009-10-14 Daniel Cullina , Alexandros G. Dimakis , Tracey Ho

In this paper, we discuss codes for distributed storage systems with hierarchical repair properties. Specifically, we devote attention to the repair problem of the rack-aware storage model with locality, aiming to enhance the system's…

Information Theory · Computer Science 2024-01-30 Yumeng Yang , Han Cai , Xiaohu Tang

The explosion of the amount of data stored in cloud systems calls for more efficient paradigms for redundancy. While replication is widely used to ensure data availability, erasure correcting codes provide a much better trade-off between…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-03-16 Steve Jiekak , Anne-Marie Kermarrec , Nicolas Le Scouarnec , Gilles Straub , Alexandre Van Kempen
‹ Prev 1 2 3 10 Next ›