On repairing erasure coded data in an active-passive mixed storage network Online publication date: Thu, 09-Apr-2015
by Frédérique Oggier; Anwitaman Datta
International Journal of Information and Coding Theory (IJICOT), Vol. 3, No. 1, 2015
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Coding Theory (IJICOT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook