Home // CTRQ 2018, The Eleventh International Conference on Communication Theory, Reliability, and Quality of Service // View article

Reliability of Erasure Coded Systems under Rebuild Bandwidth Constraints

Authors:
Ilias Iliadis

Keywords: Storage; Reliability; Data placement; MTTDL; EAFDL; RAID; MDS codes; Information Dispersal Algorithm; Prioritized rebuild; Repair bandwidth; Network bandwidth constraint.

Abstract:
Modern storage systems employ erasure coding redundancy and recovering schemes to ensure high data reliability at high storage efficiency. The widely used replication scheme belongs to this broad class of erasure coding schemes. The effectiveness of these schemes has been evaluated based on the Mean Time to Data Loss (MTTDL) and the Expected Annual Fraction of Data Loss (EAFDL) metrics. To improve the reliability of data storage systems, certain data placement and rebuild schemes reduce the rebuild times by recovering data in parallel from the storage devices. It is often assumed though that there is sufficient network bandwidth to transfer the data required by the rebuild process at full speed. In large-scale data storage systems, however, the network bandwidth is constrained. This article obtains the MTTDL and EAFDL of erasure coded systems analytically for the symmetric, clustered, and declustered data placement schemes under network rebuild bandwidth constraints. The resulting reliability degradation is assessed and the results obtained establish that the declustered placement scheme offers superior reliability in terms of both metrics. Efficient codeword configurations that achieve high reliability in the presence of network rebuild bandwidth constraints are identified.

Pages: 1 to 10

Copyright: Copyright (c) IARIA, 2018

Publication date: April 22, 2018

Published in: conference

ISSN: 2308-4022

ISBN: 978-1-61208-629-3

Location: Athens, Greece

Dates: from April 22, 2018 to April 26, 2018