English
Related papers

Related papers: When Can Helper Node Selection Improve Regeneratin…

200 papers

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

MDS array codes are widely used in storage systems due to their computationally efficient encoding and decoding procedures. An MDS code with $r$ redundancy nodes can correct any $r$ node erasures by accessing all the remaining information…

Information Theory · Computer Science 2016-03-04 Zhiying Wang , Itzhak Tamo , 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

Coding for distributed storage gives rise to a new set of problems in coding theory related to the need of reducing inter-node communication in the system. A large number of recent papers addressed the problem of optimizing the total amount…

Information Theory · Computer Science 2017-06-02 Itzhak Tamo , Min Ye , Alexander Barg

This paper addresses the problem of constructing MDS codes that enable exact repair of each code block with small repair bandwidth, which refers to the total amount of information flow from the remaining code blocks during the repair…

Information Theory · Computer Science 2017-09-26 Ankit Singh Rawat , Itzhak Tamo , Venkatesan Guruswami , Klim Efremenko

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

In this paper, we study distributed storage problems over unidirectional ring networks. A lower bound on the reconstructing bandwidth to recover total original data for each user is proposed, and it is achievable for arbitrary parameters.…

Information Theory · Computer Science 2014-01-22 Jiyong Lu , Xuan Guang , Fang-Wei Fu

This paper presents a flexible irregular model for heterogeneous cloud storage systems and investigates how the cost of repairing failed nodes can be minimized. The fractional repetition code, originally designed for minimizing repair…

Information Theory · Computer Science 2016-11-18 Quan Yu , Chi Wan Sung , Terence H. Chan

Distributed storage systems with replication are well known for storing large amount of data. A large number of replication is done in order to provide reliability. This makes the system expensive. Various methods have been proposed over…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-10-01 Mit Sheth , Krishna Gopal Benerjee , Manish K. Gupta

The high repair cost of (n,k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called Regenerating Codes, that optimally trade off storage cost for repair bandwidth. In this paper, we address…

Information Theory · Computer Science 2010-04-28 Changho Suh , Kannan Ramchandran

The repair bandwidth of a code is the minimum amount of data required to repair one or several failed nodes (erasures). For MDS codes, the repair bandwidth is bounded below by the so-called cut-set bound, and codes that meet this bound with…

Information Theory · Computer Science 2017-10-20 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

Maximum distance separable (MDS) codes are optimal error-correcting codes in the sense that they provide the maximum failure-tolerance for a given number of parity nodes. Suppose that an MDS code with $k$ information nodes and $r=n-k$…

Information Theory · Computer Science 2016-04-11 Min Ye , Alexander Barg

This paper investigates the use of redundancy and self repairing against node failures in distributed storage systems, using various strategies. In replication method, access to one replication node is sufficient to reconstruct a lost node,…

Information Theory · Computer Science 2011-10-03 Abbas Kiani , Soroush Akhlaghi

The paper is devoted to the problem of erasure coding in distributed storage. We consider a model of storage that assumes that nodes are organized into equally sized groups, called racks, that within each group the nodes can communicate…

Information Theory · Computer Science 2019-01-15 Zitan Chen , Alexander Barg

Minimum storage regenerating (MSR) codes are a class of maximum distance separable (MDS) array codes capable of repairing any single failed node by downloading the minimum amount of information from each of the helper nodes. However, MSR…

Information Theory · Computer Science 2024-08-30 Vinayak Ramkumar , Netanel Raviv , Itzhak Tamo

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

Video on-demand streaming from Internet-based servers is becoming one of the most important services offered by wireless networks today. In order to improve the area spectral efficiency of video transmission in cellular systems, small cells…

Networking and Internet Architecture · Computer Science 2015-03-19 Karthikeyan Shanmugam , Negin Golrezaei , Alexandros G. Dimakis , Andreas F. Molisch , Giuseppe Caire

Maximum distance separable (MDS) codes are widely used in distributed storage systems as they provide optimal fault tolerance for a given amount of storage overhead. The seminal work of Dimakis~\emph{et al.} first established a lower bound…

Information Theory · Computer Science 2026-03-24 Zihao Zhang , Guodong Li , Sihuang Hu

Distributed storage systems and associated storage codes can efficiently store a large amount of data while ensuring that data is retrievable in case of node failure. The study of such systems, particularly the design of storage codes over…

Information Theory · Computer Science 2014-09-26 David Karpuk , Camilla Hollanti , Amaro Barreal
‹ Prev 1 4 5 6 7 8 10 Next ›