Font Size: a A A

P2p-based Network Storage Technology Research

Posted on:2006-08-04Degree:MasterType:Thesis
Country:ChinaCandidate:Y LiuFull Text:PDF
GTID:2208360152998548Subject:Computer system architecture
Abstract/Summary:PDF Full Text Request
With the rapid development of Internet technology,the increasing user and massive data bring the new challenge for the distributed storage technology. On the other hand, with the development of peer-to-peer(P2P) computing paradigm, network bandwidth and the capacity of Internet-based end-systems, the end-systems ignored in the past become valuable computing resources. How to utilize the end-systems resources to build a distributed storage system with large-scale, high scalability, reliability and performance in a dynamic peer-to-peer network environment is a hot research topic in recent years. Based on in-depth understanding and research on current P2P technology, We design a P2P-based distributed storage system—PeerStore. The main idea of PeerStore is to organize a large number of nodes distributed in Internet, unite the idle storage resources of nodes, and build a high scalability, realibility, performance and cheap distributed storage system with P2P technology. PeerStore is made up of a great number of geographically distributed nodes, each node is an independent computer with its own storage space, linked with another one by P2P overlay and each node adopts structured routing algorithm to locate file. PeerStore is a kind of P2P system based on virtual distributed searching tree: each node only stores a part of the whole tree, the tree can be built only through the cooperation of these nodes. The search strategy of PeerStore is very efficient; furthermore, it greatly decreases the network traffics. PeerStore is a pure distributed system and does not need central node. It works entirely by the exchange of information of the routing tabale. The main functions of PeerStore include the construction of Peerstore, the file searching and locating, the information exchange among nodes and so on. The dissertation also defines the PeerStore communicaton information format based on XML. In the end, this paper analyzes the construction algorithm and searching algorithm theoretically, and does experiments to test the locating expenses of PeerStore. The results show that PeerStore is a distributed system with self-construction capability; effective searching performance and high resilience; it has great advantage in info-sharing applications.
Keywords/Search Tags:Peer-to-Peer computing, Distributed storage system, P2P overlay, Routing algorithm, XML
PDF Full Text Request
Related items