arXiv Analytics

Sign in

arXiv:1311.4096 [cs.IT]AbstractReferencesReviewsResources

Distributed Data Storage Systems with Opportunistic Repair

Vaneet Aggarwal, Chao Tian, Vinay A. Vaishampayan, Yih-Farn R. Chen

Published 2013-11-16, updated 2014-11-06Version 2

The reliability of erasure-coded distributed storage systems, as measured by the mean time to data loss (MTTDL), depends on the repair bandwidth of the code. Repair-efficient codes provide reliability values several orders of magnitude better than conventional erasure codes. Current state of the art codes fix the number of helper nodes (nodes participating in repair) a priori. In practice, however, it is desirable to allow the number of helper nodes to be adaptively determined by the network traffic conditions. In this work, we propose an opportunistic repair framework to address this issue. It is shown that there exists a threshold on the storage overhead, below which such an opportunistic approach does not lose any efficiency from the optimal storage-repair-bandwidth tradeoff; i.e. it is possible to construct a code simultaneously optimal for different numbers of helper nodes. We further examine the benefits of such opportunistic codes, and derive the MTTDL improvement for two repair models: one with limited total repair bandwidth and the other with limited individual-node repair bandwidth. In both settings, we show orders of magnitude improvement in MTTDL. Finally, the proposed framework is examined in a network setting where a significant improvement in MTTDL is observed.

Comments: 18 pages, revision from Infocom paper. arXiv admin note: text overlap with arXiv:0803.0632 by other authors
Journal: Proc.Infocomm, Apr. 2014, pp.1-9
Categories: cs.IT, math.IT
Related articles: Most relevant | Search more
arXiv:1709.02497 [cs.IT] (Published 2017-09-08)
Optimal-Dimensionality Sampling on the Sphere: Improvements and Variations
arXiv:2205.06257 [cs.IT] (Published 2022-05-12)
Coded Data Rebalancing for Distributed Data Storage Systems with Cyclic Storage
arXiv:2105.02919 [cs.IT] (Published 2021-05-06)
Coded Gradient Aggregation: A Tradeoff Between Communication Costs at Edge Nodes and at Helper Nodes