Name
Abstract | ||
|---|---|---|
A linear block code with dimension k and length n is called a locally repairable code (LRC) with locality r if it can retrieve any coded symbol by at most r other coded symbols. LRCs have been recently proposed and used in practice in distributed storage systems such as Windows Azure Storage and Facebook HDFS-RAID. Theoretical bounds on the maximum locality of LRCs have been established, and optimal LRCs that achieve the obtained bound have been designed. Average locality of LRCs (r̅) is directly proportional to the costly repair bandwidth, disk I/O, and number of nodes involved in a repair process of a missing data block. There is a gap in the literature establishing the theoretical bounds on r̅. As an initial attempt to fill this gap, in this paper, we establish a lower bound on r̅ for the same code parameters used by Facebook HDFS-RAID. We also present a code that achieves the obtained bound. Comparing with the LRC used in Facebook HDFS-RAID, our proposed LRC improves the average locality by 22.5% without sacrificing the rate and minimum distance of the code. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/ICCNC.2017.7876166 | 2017 International Conference on Computing, Networking and Communications (ICNC) |
Keywords | Field | DocType |
Erasure coding,distributed storage systems,locally repairable codes,average locality | Locality,Upper and lower bounds,Computer science,Distributed data store,Block code,Algorithm,Theoretical computer science,Bandwidth (signal processing),Erasure code,Code (cryptography),Spread spectrum | Conference |
ISSN | ISBN | Citations |
2325-2626 | 978-1-5090-4589-1 | 0 |
PageRank | References | Authors |
0.34 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mostafa Shahabinejad | 1 | 40 | 5.62 |
| Masoud Ardakani | 2 | 380 | 42.88 |
| Majid Khabbazian | 3 | 401 | 28.66 |