张雅倩,上海交通大学

Reed-Solomon (RS) codes are widely used in distributed storage systems, such as HDFS, Google File System II, etc. Generally, a data file is encoded into an RS codeword and stored in n storage nodes with each node storing one coordinate. The repair problem of RS codes is to recover one or multiple erased nodes by downloading data from some surviving nodes, where the total amount of data downloaded is referred as repair bandwidth. Moreover, the cooperative repair of RS codes is to repair multiple erasures simultaneously in a distributed manner. In this talk, we discuss a cooperative repair framework of RS codes with two erasures.