Results 11 to 20 of about 3,391 (25)

Capacity of Wireless Distributed Storage Systems with Broadcast Repair [PDF]

arXiv, 2017
In wireless distributed storage systems, storage nodes are connected by wireless channels, which are broadcast in nature. This paper exploits this unique feature to design an efficient repair mechanism, called broadcast repair, for wireless distributed storage systems in the presence of multiple-node failures.
arxiv  

Optimal Locally Repairable Systematic Codes Based on Packings [PDF]

arXiv, 2016
Locally repairable codes are desirable for distributed storage systems to improve the repair efficiency. In this paper, we first build a bridge between locally repairable code and packing. As an application of this bridge, some optimal locally repairable codes can be obtained by packings, which gives optimal locally repairable codes with flexible ...
arxiv  

Reliability of k-out-of-n Data Storage System with Deterministic Parallel and Serial Repair [PDF]

arXiv, 2016
In this paper, we find the Laplace Stieltjes transform of the probability of data loss for the k-out-of-n distributed storage system with deterministic repair times. We consider two repair models, namely the serial and parallel repair. We show that for failure rate much lower than the repair rate, mean time of data loss for the two models is the same ...
arxiv  

Generic Secure Repair for Distributed Storage [PDF]

arXiv, 2017
This paper studies the problem of repairing secret sharing schemes, i.e., schemes that encode a message into $n$ shares, assigned to $n$ nodes, so that any $n-r$ nodes can decode the message but any colluding $z$ nodes cannot infer any information about the message.
arxiv  

Local Codes with Cooperative Repair in Distributed Storage System [PDF]

arXiv, 2016
Recently, the research on local repair codes is mainly confined to repair the failed nodes within each repair group. But if the extreme cases occur that the entire repair group has failed, the local code stored in the failed group need to be recovered as a whole.
arxiv  

Practical Repetition-Aware Grammar Compression [PDF]

arXiv, 2019
The goal of grammar compression is to construct a small sized context free grammar which uniquely generates the input text data. Among grammar compression methods, RePair is known for its good practical compression performance. MR-RePair was recently proposed as an improvement to RePair for constructing small-sized context free grammar for repetitive ...
arxiv  

Repair Strategies for Storage on Mobile Clouds [PDF]

arXiv, 2017
We study the data reliability problem for a community of devices forming a mobile cloud storage system. We consider the application of regenerating codes for file maintenance within a geographically-limited area. Such codes require lower bandwidth to regenerate lost data fragments compared to file replication or reconstruction. We investigate threshold-
arxiv  

Pattern-Driven Data Cleaning [PDF]

arXiv, 2017
Data is inherently dirty and there has been a sustained effort to come up with different approaches to clean it. A large class of data repair algorithms rely on data-quality rules and integrity constraints to detect and repair the data. A well-studied class of integrity constraints is Functional Dependencies (FDs, for short) that specify dependencies ...
arxiv  

Repairable Threshold Secret Sharing Schemes [PDF]

arXiv, 2014
In this paper, we propose a class of threshold secret sharing schemes with repairing function between shares without the help of the dealer, that we called repairable threshold secret sharing schemes. Specifically, if a share fails, such as broken or lost, it will be repaired just by some other shares. A construction of such repairable threshold secret
arxiv  

Centralized Repair of Multiple Node Failures with Applications to Communication Efficient Secret Sharing [PDF]

arXiv, 2016
This paper considers a distributed storage system, where multiple storage nodes can be reconstructed simultaneously at a centralized location. This centralized multi-node repair (CMR) model is a generalization of regenerating codes that allow for bandwidth-efficient repair of a single failed node.
arxiv