Maximum Distance Separable Array Codes Allowing Partial Collaboration
| Autor: | Shiqiu Liu, Li Chen, Yuejia Zhang |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Computer science
Process (computing) 020206 networking & telecommunications 02 engineering and technology Topology Computer Science Applications Separable space Modeling and Simulation Distributed data store Node (computer science) 0202 electrical engineering electronic engineering information engineering Code (cryptography) Point (geometry) Electrical and Electronic Engineering |
| Zdroj: | IEEE Communications Letters. 24:1612-1615 |
| ISSN: | 2373-7891 1089-7798 |
| Popis: | This letter considers the problem of repairing multiple node failures through partial collaboration in a distributed storage system (DSS). In the repair process, each failed node firstly connects to $d\geq k$ alive nodes to download data, and then exchanges data with other repairing nodes. Partial collaboration allows each failed node to only connect to some (not all) of the other repairing nodes to exchange data. Constructions of partially collaborative regenerating codes with $d=k$ at the minimum-storage regime have been studied before.We propose a code construction using the maximum distance separable (MDS) array codes to achieve $d>k$ , and show that the constructed code asymptotically approaches the minimum storage repair point as the number of failed nodes grows. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|