Update-Efficient Regenerating Codes with Minimum Per-Node Storage

Regenerating codes provide an efficient way to recover data at failed nodes in distributed storage systems. It has been shown that regenerating codes can be designed to minimize the per-node storage (called MSR) or minimize the communication overhead for regeneration (called MBR). In this work, we propose a new encoding scheme for [n,d] error- correcting MSR codes that generalizes our earlier work on error-correcting regenerating codes. We show that by choosing a suitable diagonal matrix, any generator matrix of the [n,{\alpha}] Reed-Solomon (RS) code can be integrated into the encoding matrix. Hence, MSR codes with the least update complexity can be found. An efficient decoding scheme is also proposed that utilizes the [n,{\alpha}] RS code to perform data reconstruction. The proposed decoding scheme has better error correction capability and incurs the least number of node accesses when errors are present.Comment: Submitted to IEEE ISIT 201

Secure Data Storage on Cloud through Networking

Security, privacy issue and data protection is always one of the major issue which reduces the growth and make slow the speed of rising new technologies in the field of cloud computing. The advent of an advanced model should not negotiate with the required functionalities and capabilities present in the current model. Here to avoid risk and threaten are reduced in the new model the features are improved. In this paper, a survey of the different security risks that pose a threat to the cloud is presented. This paper is a survey more specific to the different security issues that has emanated due to the nature of the service delivery models of a cloud computing system