Name
Abstract | ||
|---|---|---|
In the Hadoop distributed file systems (HDFSs), to lower costly communication traffic for data recovery, the concept of locally repairable codes (LRCs) has been recently proposed. With regard to the immense size of modern energy-hungry HDFS, computational complexity reduction can be attractive. In this letter, to avoid finite field multiplications, which are the major source of complexity, we put forward the idea of designing binary locally repairable codes (BLRCs). More specifically, we design a BLRC with a length of 15, rate of 2/3, and minimum distance of 4, which has the minimum possible locality among its type. We show that our code has lower complexity than most recent non-binary LRC in the literature while meeting other desirable requirements in HDFS such as storage overhead and reliability. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/LCOMM.2014.2332491 | Communications Letters, IEEE |
Keywords | DocType | Volume |
computational complexity,distributed databases,network operating systems,storage management,BLRC,HDFS,Hadoop distributed file system,LRC,binary locally repairable code,computational complexity reduction,data recovery,Erasure coding,hadoop distributed file system,locally repairable codes | Journal | 18 |
Issue | ISSN | Citations |
8 | 1089-7798 | 13 |
PageRank | References | Authors |
0.61 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mostafa Shahabinejad | 1 | 40 | 5.62 |
| Majid Khabbazian | 2 | 401 | 28.66 |
| Masoud Ardakani | 3 | 206 | 16.83 |