Name
Abstract | ||
|---|---|---|
For a systematic erasure code, update complexity (UC) is defined as the maximum number of parity blocks needed to be changed when some information blocks are updated. Locally repairable codes (LRCs) have been recently proposed and used in real-world distributed storage systems. In this paper, update complexity for optimal LRC is studied and both lower and upper bounds on UC are established in terms of length (n), dimension (k), minimum distance (d), and locality (r) of the code, when (r+1)|n. Furthermore, a class of optimal LRCs with small UC is proposed. Our proposed LRCs could be of interest as they improve UC without sacrificing optimality of the code. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Information Theory | Locality,Distributed data store,Algorithm,Theoretical computer science,Erasure code,Mathematics |
DocType | Volume | Citations |
Journal | abs/1606.09463 | 0 |
PageRank | References | Authors |
0.34 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mehrtash Mehrabi | 1 | 1 | 1.37 |
| Mostafa Shahabinejad | 2 | 40 | 5.62 |
| Masoud Ardakani | 3 | 206 | 16.83 |
| Majid Khabbazian | 4 | 401 | 28.66 |