On repairing erasure coded data in an active-passive mixed storage network
type: Item
instance of: scholarly article
title: On repairing erasure coded data in an active-passive mixed storage network
zbMATH Open document ID: 1364.94766
DOI: 10.1504/IJICOT.2015.068697
author: Frédérique Oggier
author: Anwitaman Datta
published in: International Journal of Information and Coding Theory
publication date: 2016-01-29T00:00:00Z
review text: Summary: Networked distributed storage systems (NDSS) use erasure codes in lieu of replication for realising data redundancy. An interesting research challenge is to derive the largest advantage from the trade-offs between storage overhead and reliability that erasure codes provide, while optimising them to satisfy specific storage needs like repairability and better degraded read performance. Many coding strategies for NDSS exploit the storage nodes' computational ability to improve on repairability by applying network coding techniques. However, not every storage node in a NDSS is necessarily endowed with computing capability. This paper studies the effects of passive nodes, i.e., nodes without computational ability, on the repairability of erasure coded data, and how they may impair the promised performance of novel coding techniques. Specifically, we determine a lower bound on the minimum storage overhead in an active-passive mixed storage network, indicative of the price to pay in storage to achieve bandwidth efficient repairability.
Mathematics Subject Classification ID: 94B60
Mathematics Subject Classification ID: 94C05
zbMATH DE Number: 6537525
zbMATH Keywords: erasure codes
zbMATH Keywords: networked distributed storage systems
zbMATH Keywords: repairability
zbMATH Keywords: coding theory
MaRDI profile type: Publication
full work available at URL: ijicot.2015.068697
OpenAlex ID: W2014261068
description: scientific article; zbMATH DE number 6537525