Locality and Availability in Distributed Storage
@article{Rawat2016LocalityAA, title={Locality and Availability in Distributed Storage}, author={A. Rawat and Dimitris Papailiopoulos and A. Dimakis and S. Vishwanath}, journal={IEEE Transactions on Information Theory}, year={2016}, volume={62}, pages={4481-4493} }
This paper studies the problem of information symbol availability in codes: we refer to a systematic code as code with (r, t)-availability if every information (systematic) symbol can be reconstructed from t disjoint groups of other code symbols, each of the sizes at most r. This paper shows that it is possible to construct codes that can support a scaling number of parallel reads while keeping the rate to be an arbitrarily high constant. It further shows that this is possible with the minimum… CONTINUE READING
Supplemental Presentations
173 Citations
Achieving arbitrary locality and availability in binary codes
- Computer Science, Mathematics
- 2015 IEEE International Symposium on Information Theory (ISIT)
- 2015
- 61
- PDF
Some Constructions of Optimal Locally Repairable Codes
- Mathematics, Computer Science
- 2018 International Symposium on Information Theory and Its Applications (ISITA)
- 2018
On codes with availability for distributed storage
- Computer Science
- 2014 6th International Symposium on Communications, Control and Signal Processing (ISCCSP)
- 2014
- 4
Codes with unequal locality
- Mathematics, Computer Science
- 2016 IEEE International Symposium on Information Theory (ISIT)
- 2016
- 28
- PDF
Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes
- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2019
- 2
- PDF
On the single-parity locally repairable codes with availability
- Mathematics, Computer Science
- 2016 IEEE/CIC International Conference on Communications in China (ICCC)
- 2016
- Highly Influenced
Design of membership matrices for (r, t)-availability in distributed storage
- Mathematics, Computer Science
- 2016 IEEE International Symposium on Information Theory (ISIT)
- 2016
- 5
- Highly Influenced
Binary cyclic codes that are locally repairable
- Mathematics, Computer Science
- 2014 IEEE International Symposium on Information Theory
- 2014
- 83
- PDF
Two classes of (r, t)-locally repairable codes
- Computer Science, Mathematics
- 2016 IEEE International Symposium on Information Theory (ISIT)
- 2016
- 12
Block-Punctured Binary Simplex Codes for Local and Parallel Repair in Distributed Storage Systems
- Computer Science
- IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
- 2018
- 2
- Highly Influenced
- PDF
References
SHOWING 1-10 OF 59 REFERENCES
Locally Repairable Codes
- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2014
- 259
- PDF
Binary cyclic codes that are locally repairable
- Mathematics, Computer Science
- 2014 IEEE International Symposium on Information Theory
- 2014
- 83
- PDF
On the Locality of Codeword Symbols
- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2012
- 562
- PDF
Repairable replication-based storage systems using resolvable designs
- Computer Science, Mathematics
- 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
- 2012
- 42
- PDF
Batch Codes Through Dense Graphs Without Short Cycles
- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2016
- 44
- PDF
Permutation code: Optimal exact-repair of a single failed node in MDS code based distributed storage systems
- Computer Science, Mathematics
- 2011 IEEE International Symposium on Information Theory Proceedings
- 2011
- 75
Optimal linear codes with a local-error-correction property
- Mathematics, Computer Science
- 2012 IEEE International Symposium on Information Theory Proceedings
- 2012
- 200
- PDF
Optimal locally repairable codes and connections to matroid theory
- Computer Science, Mathematics
- 2013 IEEE International Symposium on Information Theory
- 2013
- 185
- PDF
Repair Locality With Multiple Erasure Tolerance
- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2014
- 126
- PDF