Font Size: a A A

IStore:a Multi Strategy De-centralized Object Storage System

Posted on:2019-02-25Degree:MasterType:Thesis
Country:ChinaCandidate:B W FuFull Text:PDF
GTID:2348330542481700Subject:Engineering
Abstract/Summary:PDF Full Text Request
Data storage is the basis for a variety of applications.The volume of data increases and scalability,security,availability,and sustainability of storage increase,traditional storage technologies can not meet these demands.In recent years,distributed storage technology distribute the data on the network,it can eliminate a single node failure and increase data bandwidth,it has been received more and more attention.GFS,TFS,Swift,Ceph and other distributed systems are widely used.The main difficulty of distributed storage system is that how to maintain metadata and data consistency in an unreliable distributed network.For example,Ceph uses the scheme of separating the metadata server from the storage server and applies the Paxos algorithm to achieve consistency.These solutions put forward higher requirements on the condition monitoring and maintaining of the storage server.In order to solve this problem,a multi-policy decentralized object storage system is proposed in this paper.The main idea is to construct a basic content-addressed object storage system by using distributed hash table(DHT)technology.This basic storage system realizes Authorize the user's data(objects)storage,extraction and deletion of basic services.On this basis,users can select multiple storage strategies to achieve different quality of service(QoS)storage according to different needs.For example,for reliability and high performance,a multi-copy storage strategy may be adopted.For security reasons,Block storage strategy.The advantage of this method is that the storage node is simple,the method only need to achieve the basic functions of P2P network and object storage.reliability,security and data synchronization is maintained by the user.The main contents of this article include:(1)This paper presents a distributed object storage system model based on P2P network.The implementation principle of the system is distributed hash table chord.The nodes and nodes are interconnected into P2P networks to provide the function of route lookup.The nodes provide object storage,There are one object in the node.(2)Propose various storage strategies based on P2P network,set storage strategy options on the client page,and when the user uploads the file,select according to the need.There are no copy and no copy of the storage strategy,the three copies of the storage strategy,binary storage strategy,binary copy strategy,erasure code storage strategy,the user selects the appropriate option,the system selects the corresponding policy storage file.This design not only improves file reliability and security but also reduces system complexity.On the basis of no block without a copy,the other strategies are applied to the parallel transmission,simultaneous transmission of multiple copies and file transfer at the same time,effectively improving the performance of the system.(3)Finally,the prototype of the system is designed.The prototype has a file management module,a user management module,a network management module and a node management module.The system has file upload,file download,file delete function.Test the system,test system performance,calculate the upload and download time of different strategies,file transfer speed block faster than the block,the copy speed of the file is slower than the copy speed.System reliability test,calculate the success rate of the different strategies to find documents,the success rate of the file block is higher than the block,the rate of file copy is higher than that of no copy.
Keywords/Search Tags:distributed storage, distributed hash table, chord, p2p, object storage, erasure code, replica storage strategy, file block
PDF Full Text Request
Related items