DHT Based Key-Value Distributed Storage System

With the development of peer-to-peer model, the increasing of network bandwidth and the rapidly increasing of capacity of the Internet-based end-systems, the end-systems which was neglected in the past now become the precious resource. How to fully utilize the end-systems resource to construct a large-scale, high-scalable, high-reliable, and high-powered distributed storage system in the high dynamic p2p network environment is a hot research topic in recently years.In this article, we firstly introduced the basic knowledge of P2P, and then discussed and summarized the related technology of the distributed storage system, and then based on the systematicaly and roundly analyzed and summarized of relevant work of the peer-to-peer storage technology, I realized a key-value distributed storage system which was based on DHT-AnyStorage. This system draws the advantages of the structure network, and also draws the advantage of non-centralized structure network to avoid the defect of structure network.AnyStorage is a key-value distributed storage system which is based on DHT. It aims to supply the user high reliably and high scalable storage performance only based on the common PC structure. AnyStorage is mainly consisted of two parts, one are the common AnyStorage peers, and the other are the Super Peer Maintenance peers. Total AnyStorage peers construct a DHT ring in logical, just as Chord, and in logical, it can be divided into a global ring and some local rings. The AnyStorage peers identified by the district, and there is not special requirement between peers, but the SMPs from different regions should be full-mesh connected. AnyStorage peers are mainly used to store users'data and response to users'get data requirement; and SMP mainly used to maintain the freshness of one-hop routing table. In order to maintain the consistence of the storage data, the system timing to check the data all over the system, finding the dismatching data, and moving it to the suitable peer according some mechanism, ensure that all the data store in the match peers. AnyStorage supply three interfaces: put, get, delete operation interface.