Name
Abstract | ||
|---|---|---|
Locally repairable codes (LRCs) have been proposed and used in practice as effective coding methods for distributed storage systems (DSSs). In a DSS, information block recovery is a critical task performed in the case of data node permanent failure or temporal unavailability. Temporal node unavailability accounts for 90% of all block recoveries triggered in DSS. Since parity blocks are not needed to be recovered during a temporal node unavailability, special attention should be given to reconstruction of information blocks when trying to minimize the average bandwidth needed for block recovery. Motivated by this, in this work, we study the average locality ofinformation blocks. We obtain a lower bound on the average locality of information blocks of LRCs and design LRCs that achieve the bound. In addition to obtaining the optimal average locality for the information blocks, our codes achieve the optimal maximum locality for all the information blocks as well as some parity blocks (in some cases all the parity blocks). |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/ISIT.2017.8006514 | 2017 IEEE International Symposium on Information Theory (ISIT) |
Keywords | Field | DocType |
Linear block codes,distributed storage systems,locally repairable codes,average locality of information blocks | Discrete mathematics,Locality,Computer science,Upper and lower bounds,Block code,Distributed data store,Coding (social sciences),Unavailability,Bandwidth (signal processing),Spread spectrum | Conference |
ISBN | Citations | PageRank |
978-1-5090-4097-1 | 0 | 0.34 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mostafa Shahabinejad | 1 | 40 | 5.62 |
| Majid Khabbazian | 2 | 401 | 28.66 |
| Masoud Ardakani | 3 | 380 | 42.88 |