A Novel Technique for Storage in Cloud Data Centers

An Information Dispersal Algorithm takes a file F as a input and divide this file into n pieces that needs to be dispersed among n nodes such that any m pieces out of total n pieces will be sufficient to reconstruct the whole file F. The size of each piece is |F| / m. It must also ensure that the complete knowledge of any m-1 pieces is insufficient to reconstruct the complete file F. The ideas for accomplishing this have been given in many literatures in the past. This manuscript discusses the application of Information Dispersal Algorithms in Storage of files on cloud Data Centers instead of using previous schemes of replication

A Novel Technique for Storage in Cloud Data Centers

An Information Dispersal Algorithm takes a file F as a input and divide this file into n pieces that needs to be dispersed among n nodes such that any m pieces out of total n pieces will be sufficient to reconstruct the whole file F. The size of each piece is |F| / m. It must also ensure that the complete knowledge of any m-1 pieces is insufficient to reconstruct the complete file F. The ideas for accomplishing this have been given in many literatures in the past. This manuscript discusses the application of Information Dispersal Algorithms in Storage of files on cloud Data Centers instead of using previous schemes of replication

Cost Effective Information Dispersal and Retrieval Framework for Cloud Storage

Cloud data storage applications widely demand security of data with minimum cost. Various cloud computing security threats supposed to be addressed in Cloud data service include Data Access Controllability, Data Confidentiality, and Data Integrity. In this paper, we propose a cost effective Information Dispersal and Retrieval framework for Cloud storage. Our proposed framework is different from existing approaches of replication. In our approach, multiple datacenters are considered as virtual independent disks for storing redundant data encoded with erasure codes and hence the proposed framework enables to retrieve user file even when failure of certain number of Cloud services occur . Besides security related benefits of our approach, the application provides user the cost-availability pattern of datacenters and allows cost effective storage on Cloud within user�s budget limit

Fault-tolerant distributed computing scheme based on erasure codes

Some emerging classes of distributed computing systems, such peer-to-peer or grid computing computing systems, are composed of heterogeneous computing resources potentially unreliable. This paper proposes to use erasure codes to improve the fault-tolerance of parallel distributed computing applications in this context. A general method to generate redundant processes from a set of parallel processes is presented. This scheme allows the recovery of the result of the application even if some of the processes crash

FNT-based reed-solomon erasure codes

This paper presents a new construction of Maximum-Distance Separable (MDS) Reed-Solomon erasure codes based on Fermat Number Transform (FNT). Thanks to FNT, these codes support practical coding and decoding algorithms with complexity O(n log n), where n is the number of symbols of a codeword. An open-source implementation shows that the encoding speed can reach 150Mbps for codes of length up to several 10,000s of symbols. These codes can be used as the basic component of the Information Dispersal Algorithm (IDA) system used in a several P2P systems

AONT-LT: a Data Protection Scheme for Cloud and Cooperative Storage Systems

We propose a variant of the well-known AONT-RS scheme for dispersed storage systems. The novelty consists in replacing the Reed-Solomon code with rateless Luby transform codes. The resulting system, named AONT-LT, is able to improve the performance by dispersing the data over an arbitrarily large number of storage nodes while ensuring limited complexity. The proposed solution is particularly suitable in the case of cooperative storage systems. It is shown that while the AONT-RS scheme requires the adoption of fragmentation for achieving widespread distribution, thus penalizing the performance, the new AONT-LT scheme can exploit variable length codes which allow to achieve very good performance and scalability.Comment: 6 pages, 8 figures, to be presented at the 2014 High Performance Computing & Simulation Conference (HPCS 2014) - Workshop on Security, Privacy and Performance in Cloud Computin