Reliable Repair Mechanisms with Low Connection Cost for Code Based Distributed Storage Systems

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2014-01-01

期刊名稱

2014 EIGHTH INTERNATIONAL CONFERENCE ON SOFTWARE SECURITY AND RELIABILITY

卷期與頁次

頁 235–244

ISSN

2378-3877

ISBN

978-1-4799-4296-1

語言

英文

摘要

Erasure codes are applied in distributed storage systems for fault-tolerance with lower storage overhead than replications. Later, decentralized erasure codes are proposed for decentralized or loosely-organized storage systems. Repair mechanisms aim at maintaining redundancy over time such that stored data are still retrievable. Two recent repair mechanisms, NOOP and COOP, are designed for decentralized erasure code based distributed storage system to minimize connection cost in theoretical manner. We propose a generalized repair framework, which includes NOOP and COOP as two extreme cases. We then investigate trade-off between connection cost and data retrievability from an experimental aspect in our repair framework. Our results show that a reasonable data retrievability is achievable with constant connection cost, which is less than previously analytical values. These results are valuable references for a system manager to build a reliable storage system with low connection cost.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Lin, H.-Y., Tung, L.-P., & Lin, B.-S. P. (2014). Reliable Repair Mechanisms with Low Connection Cost for Code Based Distributed Storage Systems. 2014 EIGHTH INTERNATIONAL CONFERENCE ON SOFTWARE SECURITY AND RELIABILITY, 235–244. https://doi.org/10.1109/SERE.2014.37

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/128599