LAUSR

Locally repairable codes (LRCs) have been recently proposed and used in real-world distributed storage systems (DSSs) such as Microsoft Azure Storage and Facebook HDFS-RAID (Hadoop Distributed File System-Redundant Array of Independent Disks). Since information in DSSs is changed frequently, reducing update complexity (UC) of LRCs is of great interest. In this paper, we propose code design algorithms that can reduce UC of existing LRCs without sacrificing their important code parameters such as minimum distance, code rate, or locality. We establish bounds on UC, and use them to show that our algorithms can achieve optimal or near optimal UC for a large class of LRCs.