SpreadStore: A LDPC Erasure Code Scheme for Distributed Storage System

2010 ◽  
Author(s):  
Harihara Subramanyam G. ◽  
Balaji Janakiram ◽  
M. Girish Chandra ◽  
Aravind K.G. ◽  
Swanand Kadhe ◽  
...  
Keyword(s):  
Distributed Storage ◽  
Storage System ◽  
Code Scheme ◽  
Distributed Storage System ◽  
Erasure Code

scholarly journals Authentication Based Cloud Storage and Secure Data Forwarding

2013 ◽  
Vol 4 (1) ◽  
pp. 106-110
Author(s):  
Rajasekaran S ◽  
Kalifulla. Y ◽  
Murugesan. S ◽  
Ezhilvendan. M ◽  
Gunasekaran. J
Keyword(s):  
Data Storage ◽  
Cloud Storage ◽  
Distributed Storage ◽  
Storage System ◽  
Encryption Scheme ◽  
Data Confidentiality ◽  
Distributed Storage System ◽  
Erasure Code ◽  
Long Term Storage ◽  
Storage Servers

cloud storage system, consisting of a collection of storage servers, provides long-term storage services over the Internet.  Storing data in a third party’s cloud system causes serious concern over data confidentiality. General encryption schemes protect data confidentiality, but also limit the functionality of the storage system because a few operations are supported over encrypted data. Constructing a secure storage system that supports multiple functions is challenging when the storage system is distributed and has no central authority. We propose a threshold proxy re-encryption scheme and integrate it with a decentralized erasure code such that a secure distributed storage system is formulated. The distributed storage system not only supports secure and robust data storage and retrieval, but also lets a user forward his data in the storage servers to another user without retrieving the data back. The main technical contribution is that the proxy re-encryption scheme supports encoding operations over encrypted messages as well as forwarding operations over encoded and encrypted messages. Our method fully integrates encrypting, encoding, and forwarding. We analyze and suggest suitable parameters for the number of copies of a message dispatched to storage servers and the number of storage servers queried by a key server. These parameters allow more flexible adjustment between the number of storage servers and robustness.

scholarly journals A New Method for Reconstructing Data on a Single Failure Node in the Distributed Storage System Based on the MSR Code

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Miao Ye ◽  
Ruoyu Wei ◽  
Wei Guo ◽  
Qiuxiang Jiang ◽  
Hongbing Qiu ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Distributed Storage ◽  
Storage System ◽  
Hybrid Genetic Algorithm ◽  
Repair Process ◽  
Single Node ◽  
Distributed Storage System ◽  
Erasure Code ◽  
Repair Strategy ◽  
The Cost

As a storage method for a distributed storage system, an erasure code can save storage space and repair the data of failed nodes. However, most studies that discuss the repair of fault nodes in the erasure code mode only focus on the condition that the bandwidth of heterogeneous links restricts the repair rate but ignore the condition that the storage node is heterogeneous, the cost of repair traffic in the repair process, and the influence of the failure of secondary nodes on the repair process. An optimal repair strategy based on the minimum storage regenerative (MSR) code and a hybrid genetic algorithm is proposed for single-node fault scenarios to solve the above problems. In this work, the single-node data repair problem is modeled as an optimization problem of an optimal Steiner tree with constraints considering heterogeneous link bandwidth and heterogeneous node processing capacity and takes repair traffic and repair delay as optimization objectives. After that, a hybrid genetic algorithm is designed to solve the problem. The experimental results show that under the same scales used in the MSR code cases, our approach has good robustness and its repair delay decreases by 10% and 55% compared with the conventional tree repair topology and star repair topology, respectively; the repair flow increases by 10% compared with the star topology, and the flow rate of the conventional tree repair topology decreases by 40%.

Sign in / Sign up

Export Citation Format

Share Document