54,068 Hits in 6.0 sec

Codes for distributed storage from 3-regular graphs [article]

Shuhong Gao, Fiona Knoll, Felice Manganiello, Gretchen Matthews
2016 arXiv   pre-print
This paper considers distributed storage systems (DSSs) from a graph theoretic perspective. A DSS is constructed by means of the path decomposition of a 3- regular graph into P4 paths.  ...  The paths represent the disks of the DSS and the edges of the graph act as the blocks of storage. We deduce the properties of the DSS from a related graph and show their optimality.  ...  Conclusions In this paper, we construct distributed data storage systems from 3-regular graphs.  ... 
arXiv:1610.00043v1 fatcat:nzd5of2jf5hazizrnfe2t22x2a

On Weak Dress Codes for Cloud Storage [article]

Manish K Gupta and Anupam Agrawal and Deepak Yadav
2013 arXiv   pre-print
DRESS (Distributed Replication-based Exact Simple Storage) codes has been proposed which also optimizes the disk I/O.  ...  In a distributed storage network, reliability and bandwidth optimization can be provided by regenerating codes. Recently table based regenerating codes viz.  ...  ACKNOWLEDGMENT The authors would like to thank Suman Mitra for useful discussions and Ashish Jain, Jay Bhornia and Srijan Anil for drawing some figures.  ... 
arXiv:1302.3681v1 fatcat:fccoze43nvaffe7r2e3nn2yjue

Enumerating Some Fractional Repetition Codes [article]

Srijan Anil and Manish K. Gupta and T. Aaron Gulliver
2013 arXiv   pre-print
We also present algorithms for constructing regular graphs which give rise to FR codes.  ...  In a distributed storage systems (DSS), regenerating codes are used to optimize bandwidth in the repair process of a failed node.  ...  ACKNOWLEDGMENT The authors would like to thank Krishna Gopal Benerjee for useful discussions and Nikhil Agrawal for writing parts of the program for FR code enumeration and drawing some of the figures.  ... 
arXiv:1303.6801v1 fatcat:2v4cmcrgozcvhbptmso2crdzvq

On Some Universally Good Fractional Repetition Codes [article]

Shreyansh A. Prajapati, Manish K. Gupta
2016 arXiv   pre-print
Data storage in Distributed Storage Systems (DSSs) is a multidimensional optimization problem.  ...  In particular, some constructions of codes for heterogeneous DSSs are given using partial regular graph (where number of packets on each node is different) and ring construction.  ...  Distributed Distributed Storage Systems (DSS) are widely used to store a large amount of data with high reliability for a long period of time using a distributed collection of storage nodes in large data  ... 
arXiv:1609.03106v1 fatcat:ucwlbm64ujbqzeiwnnlw6skcge

LDPC Code Design for Distributed Storage: Balancing Repair Bandwidth, Reliability and Storage Overhead [article]

Hyegyeong Park, Dongwon Lee, Jaekyun Moon
2017 arXiv   pre-print
Distributed storage systems suffer from significant repair traffic generated due to frequent storage node failures.  ...  In particular, with a careful construction of the factor graph, both low repair-bandwidth and high reliability can be achieved for a given code rate.  ...  This property makes the LDPC codes a powerful option for distributed storage.  ... 
arXiv:1710.05615v1 fatcat:ldih6l5xubdr7bvp5367izo4si

LDPC Codes for 2D Arrays

Yuval Cassuto, Amin Shokrollahi
2014 IEEE Transactions on Information Theory  
Binary codes over 2D arrays are very useful in data storage, where each array column represents a storage device or unit that may suffer failure.  ...  In this paper, we propose a new framework for probabilistic construction of codes on 2D arrays.  ...  They would also like to thank Igal Sason for valuable discussions.  ... 
doi:10.1109/tit.2014.2313720 fatcat:527v5jryybcnxd7s3ajltjslhy

The fundamental theorem of distributed storage systems revisited

Ping Hu, Kenneth W. Shum, Chi Wan Sung
2014 2014 IEEE Information Theory Workshop (ITW 2014)  
Furthermore, a simple alternative proof for the achievability of the min-cut bound is presented, which is based on the construction of the generic storage code, a restricted form of generic network code  ...  The proof techniques in this paper are expected to be extensible to other more complex models of distributed storage systems.  ...  DISTRIBUTED STORAGE SYSTEMS In a distributed storage system (DSS), there are n storage nodes. A file of B symbols from an alphabet set Σ has to be stored in the DSS.  ... 
doi:10.1109/itw.2014.6970793 dblp:conf/itw/HuSS14 fatcat:xmslrr443ne2tnebkcblls56hu

A practical analysis of low-density parity-check erasure codes for wide-area storage applications

J.S. Plank, M.G. Thomason
2004 International Conference on Dependable Systems and Networks, 2004  
This paper attempts to illuminate the practical considerations of LDPC codes for peer-to-peer and distributed storage systems.  ...  As peer-to-peer and widely distributed storage systems proliferate, the need to perform efficient erasure coding, instead of replication, is crucial to performance and efficiency.  ...  Each graph plots four curves -the best codes generated from distributions designed for the particular code and rate, the best codes generated from distributions designed for the particular code, but not  ... 
doi:10.1109/dsn.2004.1311882 dblp:conf/dsn/PlankT04 fatcat:2m2c67iqqjabzazuisbeomru2e

A Network Coding Based Energy Efficient Data Backup in Survivability-Heterogeneous Sensor Networks

Jie Tian, Tan Yan, Guiling Wang
2015 IEEE Transactions on Mobile Computing  
The guidelines are based on random linear network coding and provide lower bounds of the number of robust sensors that each regular sensor should choose for data backup, such that the required fault tolerance  ...  A centralized algorithm and a distributed algorithm are developed based on the guidelines such that regular sensors can back up their data efficiently.  ...  A decentralized erasure code for data storage is proposed in [5] , in which data sources are distributed in the network.  ... 
doi:10.1109/tmc.2014.2374168 fatcat:k3u2xtuotnbq7kde33zmo3hl2q

Optimal Fractional Repetition Codes and Fractional Repetition Batch Codes [article]

Natalia Silberstein, Tuvi Etzion
2015 arXiv   pre-print
Fractional repetition (FR) codes is a family of codes for distributed storage systems (DSS) that allow uncoded exact repairs with minimum repair bandwidth.  ...  The constructions of these FR codes are based on families of regular graphs, such as Tur\'an graphs and graphs with large girth; and on combinatorial designs, such as transversal designs and generalized  ...  An FRB code is a combination of an FR code and an uniform combinatorial batch code. The family of codes called batch codes was proposed in [8] for load balancing in distributed storage.  ... 
arXiv:1501.05177v1 fatcat:akmnyw7mobd65kfdlaw4lq4ore

Bounds on Fractional Repetition Codes using Hypergraphs [article]

Krishna Gopal Benerjee, Manish K Gupta
2018 arXiv   pre-print
In the Distributed Storage Systems (DSSs), an encoded fraction of information is stored in the distributed fashion on different chunk servers.  ...  In general, the necessary and sufficient conditions for the existence of an FR code is obtained by using the correspondence. Some of the bounds are new and FR codes meeting these bounds are unknown.  ...  In [3] , FR codes are constructed from complete graphs and regular graphs.  ... 
arXiv:1711.07631v2 fatcat:t7ftpdtbibe5hd2hubcy7lxigm

High-rate storage codes on triangle-free graphs [article]

Alexander Barg, Gilles Zémor
2022 arXiv   pre-print
In this work we construct infinite families of linear storage codes with high rate relying on coset graphs of binary linear codes.  ...  We also derive necessary conditions for such codes to have high rate, and even rate potentially close to one.  ...  Thus, from Theorem 6, the most we can hope for the storage code constructed on the coset graph of C r is rate 3/4.  ... 
arXiv:2110.02378v2 fatcat:xde2ywntazdr3kl4jayrztmbea

On the Optimal Minimum Distance of Fractional Repetition Codes [article]

Bing Zhu, Kenneth W. Shum, Weiping Wang, Jianxin Wang
2020 arXiv   pre-print
The optimal constructions are derived from regular graphs and combinatorial designs, respectively.  ...  Fractional repetition (FR) codes are a class of repair efficient erasure codes that can recover a failed storage node with both optimal repair bandwidth and complexity.  ...  For example, we consider now an (8, 3, 2)-FR code, which can be constructed from a 3-regular graph on 8 vertices.  ... 
arXiv:2005.06823v1 fatcat:vyncgfmbjvfnlnbjszom46ve7a

Scalable constructions of fractional repetition codes in distributed storage systems

Joseph C. Koo, John T. Gill
2011 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
In distributed storage systems built using commodity hardware, it is necessary to have data redundancy in order to ensure system reliability.  ...  In this work, we investigate systems where node sizes may be much larger than replication degrees, and explicitly provide algorithms for constructing these storage designs.  ...  Block design for distributed storage system corresponding to k = 3 and l = 7. Each data chunk has 3 replicas and each storage node stores 7 chunks.  ... 
doi:10.1109/allerton.2011.6120326 dblp:conf/allerton/KooG11 fatcat:cd6t4nto25ewlmri7vauedyp7q

Structure, property, and design of nonbinary regular cycle codes

Jie Huang, Shengli Zhou, Peter Willett
2010 IEEE Transactions on Communications  
This equivalent structure of H enables: i) parallel processing in lineartime encoding; ii) considerable resource reduction on the code storage for encoding and decoding; and iii) parallel processing in  ...  Through graph analysis, we show that the parity check matrix H of a regular cycle code can be put into an equivalent structure in the form of concatenation of row-permuted block-diagonal matrices if d  ...  TABLE III CYCLE III DISTRIBUTION SPECTRUM OF REGULAR CYCLE GF(64) CODES OF RATE 1/2 DESIGNED BY THE PROPOSED METHOD taken from [13] are also included for comparison which are constructed from known good  ... 
doi:10.1109/tcomm.2010.04.080558 fatcat:gbkm5tzoljc6fg3u3m55yciq5q
« Previous Showing results 1 — 15 out of 54,068 results