A Multi-Server Erasure Code Algorithm Based on the Degree of Restriction

2013 ◽  
Vol 717 ◽  
pp. 789-793
Author(s):  
Jun Wei Ge ◽  
Ai Hua Miao ◽  
Yi Qiu Fang
Keyword(s):  
System Performance ◽  
Cloud Storage ◽  
Storage System ◽  
Erasure Codes ◽  
Storage Space ◽  
High Recovery ◽  
Erasure Code ◽  
Code Algorithm ◽  
Cloud Storage Environment ◽  
Multi Server

Erasure codes received extensive attention in the cloud storage system because of its effective on saving storage space,However, due to the high recovery-overhead of erasure code, its application has been limited in these storage systems.For these problems,in this paper,we presents A multi-server Erasure code algorithm based on the degree of restriction to reduce the recovery-overhead from the restriction of date and parity's degree,and enhance the system performance to a certain extent ,ensure the reliability of the data of the cloud storage environment.

Ubackup: An Easy Way to Build a High-Efficient Private Cloud Storage System

2014 ◽  
Vol 556-562 ◽  
pp. 6241-6245 ◽  
Author(s):  
Kai Guo ◽  
Peng Yan Shen ◽  
Ming Zhong Xiao
Keyword(s):  
Cloud Storage ◽  
Storage System ◽  
Utilization Rate ◽  
Private Cloud ◽  
Erasure Code ◽  
Balance System ◽  
High Efficient ◽  
Code Algorithm ◽  
Disaster Tolerance ◽  
The Cost

In this paper, we present UBackup, which describes an easy way to build a private cloud storage system with high-efficient and high-disaster-tolerance. UBackup client enables file-level de-duplication by using a file fingerprint check. The utilization of compressed erasure code algorithm ensures data security and cuts down the cost. A space utilization rate variance minimizing algorithm is used on index server to balance system load. We present the system architecture of UBackup and its components, and we have implemented a proof-of-concept prototype of UBackup. By conducting performance evaluation in a public Internet, experimental results demonstrate the efficiency of the system.

Single node repair algorithm for a multimedia cloud storage system based on network coding

2021 ◽  
Vol 27 (3) ◽  
pp. 205-214
Author(s):  
Xin Niu ◽  
Jingjing Jiang
Keyword(s):  
Network Coding ◽  
Cloud Storage ◽  
Storage System ◽  
University Teaching ◽  
Easy Access ◽  
Single Node ◽  
Storage Cost ◽  
Multimedia Cloud ◽  
Code Algorithm ◽  
Node Repair

Multimedia is inconvenient to use, difficult to maintain, and redundant in data storage. In order to solve the above problems and apply cloud storage to the integration of university teaching resources, this paper designs a virtualized cloud storage platform for university multimedia classrooms. The platform has many advantages, such as reducing the initial investment in multimedia classrooms, simplifying management tasks, making maximum use of actual resources and easy access to resources. Experiments and analysis show the feasibility and effectiveness of the platform. Aiming at the problems of the single-node repair algorithm of the existing multimedia cloud storage system, the limited domain is large, the codec complexity is high, the disk I/O (Input/Output) cost is high, the storage overhead and the repair bandwidth are unbalanced, and a network coding-based approach is proposed. Multimedia cloud storage. System single node repair algorithm. The algorithm stores the grouped multimedia file data in groups in the system, and performs XOR (exclusive OR) on the data in the group on the GF(2) finite field. When some nodes fail, the new node only needs to be connected. Two to three non-faulty nodes in the same group can accurately repair the data in the failed node. Theoretical analysis and simulation results show that the algorithm can reduce the complexity and repair of the codec, and reduce the disk I/O overhead. In this case, the storage cost of the algorithm is consistent with the storage cost based on the minimum storage regeneration code algorithm, and the repair bandwidth cost is close to the minimum bandwidth regeneration code algorithm.

scholarly journals BMCloud: Minimizing Repair Bandwidth and Maintenance Cost in Cloud Storage

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Chao Yin ◽  
Changsheng Xie ◽  
Jiguang Wan ◽  
Chih-Cheng Hung ◽  
Jinjiang Liu ◽  
...  
Keyword(s):  
Fault Tolerance ◽  
Cloud Storage ◽  
Storage System ◽  
The Other ◽  
Maintenance Cost ◽  
Erasure Code ◽  
Networked Storage ◽  
Efficient Recovery ◽  
System Prototype ◽  
Exact Repair

To protect data in cloud storage, fault tolerance and efficient recovery become very important. Recent studies have developed numerous solutions based on erasure code techniques to solve this problem using functional repairs. However, there are two limitations to address. The first one is consistency since the Encoding Matrix (EM) is different among clouds. The other one is repairing bandwidth, which is a concern for most of us. We addressed these two problems from both theoretical and practical perspectives. We developed BMCloud, a new low repair bandwidth, low maintenance cost cloud storage system, which aims to reduce repair bandwidth and maintenance cost. The system employs both functional repair and exact repair while it inherits advantages from the both. We propose the JUDGE_STYLE algorithm, which can judge whether the system should adopt exact repair or functional repair. We implemented a networked storage system prototype and demonstrated our findings. Compared with existing solutions, BMCloud can be used in engineering to save repair bandwidth and degrade maintenance significantly.

Data Consistency Research of the Cloud Storage Environment Based on P2P Technology

2013 ◽  
Vol 380-384 ◽  
pp. 2589-2592
Author(s):  
Jun Wei Ge ◽  
Feng Yang ◽  
Yi Qiu Fang
Keyword(s):  
Cloud Storage ◽  
High Performance ◽  
Storage System ◽  
Model Systems ◽  
Data Consistency ◽  
Service Reliability ◽  
Cloud Storage Environment ◽  
P2p Technology ◽  
Server Architecture

Many of the characteristics of P2P technology such as decentralization, scalability, robustness, high performance and load balancing are in line with the cloud storage design requirements. In this article, it proposesd a cloud storage model based on P2P technology. This model uses multivariate data server architecture, which can effectively solve the bottleneck problem of centralized cloud storage system. Thereby increasing the cloud storage system performance and the quality of cloud storage services, enhance service reliability. In this article, through researching data consistency algorithm named Paxos and the model systems metadata consistency problem, we improve and optimize Basic Paxos making it applied in the model system.

Performance Measurement Technique of Cloud Storage System

2013 ◽  
Vol 760-762 ◽  
pp. 1197-1201
Author(s):  
Qin Lu He ◽  
Zhan Huai Li ◽  
Le Xiao Wang ◽  
Hui Feng Wang ◽  
Jian Sun
Keyword(s):  
Cloud Storage ◽  
File System ◽  
Storage System ◽  
File Systems ◽  
Test Methods ◽  
Theory Analysis ◽  
Network File System ◽  
Cloud Storage Environment ◽  
System File ◽  
Reasonable Test

Researches on technologies about testing aggregate bandwidth of file systems in cloud storage systems. Through the memory file system, network file system, parallel file system theory analysis, according to the cloud storage system polymerization bandwidth and concept, developed to cloud storage environment file system polymerization bandwidth test software called FSPoly. In this paper, use FSpoly to luster file system testing, find reasonable test methods, and then evaluations latest development in cloud storage system file system performance by using FSPoly.

scholarly journals Improving the Efficiency of Deduplication Process by Dedicated Hash Table for each Digital Data Type in Cloud Storage System

Webology ◽  
2021 ◽  
Vol 18 (Special Issue 01) ◽  
pp. 288-301
Author(s):  
G. Sujatha ◽  
Dr. Jeberson Retna Raj
Keyword(s):  
Data Storage ◽  
Cloud Storage ◽  
Storage System ◽  
Hash Table ◽  
Cloud Services ◽  
Data Type ◽  
Digital Data ◽  
Storage Space ◽  
Data Deduplication ◽  
Worst Case

Data storage is one of the significant cloud services available to the cloud users. Since the magnitude of information outsourced grows extremely high, there is a need of implementing data deduplication technique in the cloud storage space for efficient utilization. The cloud storage space supports all kind of digital data like text, audio, video and image. In the hash-based deduplication system, cryptographic hash value should be calculated for all data irrespective of its type and stored in the memory for future reference. Using these hash value only, duplicate copies can be identified. The problem in this existing scenario is size of the hash table. To find a duplicate copy, all the hash values should be checked in the worst case irrespective of its data type. At the same time, all kind of digital data does not suit with same structure of hash table. In this study we proposed an approach to have multiple hash tables for different digital data. By having dedicated hash table for each digital data type will improve the searching time of duplicate data.

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 Performance and Time Improvement of LT Codes-based Cloud Storage

2021 ◽  
Author(s):  
Nastaran Chakani ◽  
Seyed Masoud Mirrezaei ◽  
Ghosheh Abed Hodtani
Keyword(s):  
Degree Distribution ◽  
Cloud Storage ◽  
Storage System ◽  
Data Retrieval ◽  
Storage Space ◽  
Improve Performance ◽  
Lt Codes ◽  
Storage Performance ◽  
Decoding Efficiency ◽  
Cloud Storage Services

Abstract Outsourcing data on the cloud storage services has already attracted great attention due to prospect of rapid data growth and storing efficiencies for customers. The coding-based cloud storage approach can offer more reliable and faster solution with less storage space in comparison with replication-based cloud storage. LT codes as a famous member of rateless codes family can improve performance of storage systems utilizing good degree distributions. Since degree distribution plays key role in LT codes performance, recently introduced Poisson Robust Soliton Distribution (PRSD) and Combined Poisson Robust Soliton Distribution (CPRSD) motivate us to investigate LT codes-based cloud storage system. So, we exploit LT codes with new degree distributions in order to provide lower average degree and higher decoding efficiency, specifically when receiving fewer encoding symbols, comparing with popular degree distribution, Robust Soliton Distribution (RSD). In this paper, we show that proposed cloud storage outperforms traditional ones in terms of storage space and robustness encountering unavailability of encoding symbols, due to compatible properties of PRSD and CPRSD with cloud storage essence. Furthermore, modified decoding process based on required encoding symbols behavior is presented to reduce data retrieval time. Numerical results confirm improvement of cloud storage performance.

Based on Cloud-Technology Data Storage Security

2014 ◽  
Vol 556-562 ◽  
pp. 6179-6183
Author(s):  
Zhi Gang Chai ◽  
Ming Zhao ◽  
Xiao Yu
Keyword(s):  
Cloud Computing ◽  
Data Storage ◽  
Cloud Storage ◽  
Rapid Development ◽  
Storage System ◽  
Storage Space ◽  
It Industry ◽  
Storage Security ◽  
The Cost ◽  
Space Requirements

With the rapid development of information technology, the extensive use of cloud computing promotes technological change in the IT industry. The use of cloud storage industry is also one solution to the problem of an amount of data storing, which is traditionally large, and unimaginably redundant. The use of cloud computing in the storage system connects the user's data with network clients via the Internet. That is to say, it not only solves a lot of data storage space requirements in request, but also greatly reduces the cost of the storage system. But in the application of cloud storage, there are also many problems to be solved, even to some extent which has hindered the development of cloud storage. Among these issues, the most concerning one is cloud storage security. The following passages discuss the problem and propose a solution to it.

Sign in / Sign up

Export Citation Format

Share Document