Earticle

초록

영어

Distributed storage of cloud data imposes a great challenge for assuring data availability and reliability in the face of stochastic failures and attacks. Although redundancy scheme such as erasure codes or network coding schemes can be used to improve storage efficiency, they do not consider the scenario that the network may be split up into several regions due to correlated failures of storage components, which may not successfully reconstruct the original data. Furthermore, the stored data on the failed node need to be recovered to keep the same redundancy of network data while introducing low overhead. In view of this, we first devise an efficient algorithm that guarantees residual network has enough data segments to recreate the original data under correlated failures. Second, an efficient data recovery scheme is presented to repair the data stored on the failed nodes in case of Byzantine failures or pollution attacks. The proposed protocol benefits from several key features such as less storage cost, competitive communication cost, and much better data robustness comparing to the state of the art distributed storage systems.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Models and Problem Formulation
  3.1. The System Model
  3.2. Problem Formulation
 4. The Proposed Scheme
  4.1. Data Encoding
  4.2. Coded Symbol Distribution
  4.3. Data Reconstruction
  4.4. Regenerating Lost Symbols
 5. Analysis
  5.1. Fault-tolerant Capability
  5.2. Security Strength
  5.3. Redundancy Ratio
 6. Performance Evaluation
 7. Conclusions
 Acknowledgments
 References

키워드

저자

• Zhiqiang Ruan [ Department of Computer, Science Minjiang University, Fuzhou, China Institute of Information Engineering, Chinese Academy of Science, Beijing, China ]
• Zhi Li [ Department of Computer, Science Minjiang University, Fuzhou, China Institute of Information Engineering, Chinese Academy of Science, Beijing, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605