By Topic

Recoverability of Erasure Codes Based and Intensively Written Storage Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiangyu Luo ; Key Lab. of CNII, Southeast Univ., Nanjing, China ; Yun Wang

We consider a mutable distributed storage system that protects data using systematic linear k-of-n codes. Such a system may get into a partial updated state if some failures occur, and may become unrecoverable even though there are k+ living bricks (for they may be inconsistent with each other). General recovery mechanisms judge whether the system is recoverable according to the maximum number of consistent living bricks. We prove the condition that there are at least k consistent living bricks is not necessary for system recovery. We also investigate the recoverability that can be gained under the general recovery mechanisms. The condition for assuring recoverability is figured out, and the quantitative evaluation of stochastic recoverability is explored. Our simulation results show that the tolerable bounds of erased blocks not only depend on the number of partial updates, but also on the proportion between original blocks and redundant blocks that are erased.

Published in:

Secure Software Integration and Reliability Improvement (SSIRI), 2010 Fourth International Conference on

Date of Conference:

9-11 June 2010