Reducing repair traffic for erasure coding-based storage via interference alignment

We consider the problem of recovering from a single node failure in a storage system based on an (n, k) MDS code. In such a scenario, a straightforward solution is to perform a complete decoding, even though the data to be recovered only amount to 1/kth of the entire data. This paper presents techni...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE International Symposium on Information Theory pp. 2276 - 2280
Main Authors Yunnan Wu, Dimakis, A.G.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2009
Subjects
Artificial intelligence
Bandwidth
Computer networks
Decoding
Equations
Interference
Maintenance
Protection
Telecommunication traffic
Online AccessGet full text

Cover

More Information
Summary:We consider the problem of recovering from a single node failure in a storage system based on an (n, k) MDS code. In such a scenario, a straightforward solution is to perform a complete decoding, even though the data to be recovered only amount to 1/kth of the entire data. This paper presents techniques that can reduce the network traffic incurred. The techniques perform algebraic alignment so that the effective dimension of unwanted information is reduced.
ISBN:9781424443123
1424443121
ISSN:2157-8095
2157-8117
DOI:10.1109/ISIT.2009.5205898