Font Size: a A A

Research On Global Persistent Object Storage System Based On Peer-to-Peer Network

Posted on:2005-10-15Degree:MasterType:Thesis
Country:ChinaCandidate:M LiFull Text:PDF
GTID:2168360152968061Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
The thesis concerns the construction of global object storage system in peer-to-peer environment. It focuses on the system architecture, routing information gathering, bandwidth adaptive routing, and distributed object query.The concept of global storage system is brought out in the thesis. Global storage system is a grand scale networking storage system constructed on wide area network. It provides data storage service with grand scale, high availability, and high reliability. Granary is a global storage system built by Tsinghua University. Granary adopts object as its storage unit. It provides data query and event driven. It adopts double secure measurement, that is, user encoding and system encoding. Its data placement and locating are through high performance routing protocol. It enhances the data availability and accessing performance by data replicating and probability replication. It provides complex and high performance query service. Event driven accessing mode is supported in granary.To meet global storage system's requirement for high performance, high reliability routing, the adaptive routing algorithm are discussed in the thesis. A novel bandwidth adaptive routing algorithm, SmartBoa, is presented in the thesis. In SmartBoa, node's routing table size and its maintenance cost are in proportion to the node's available bandwidth. SmartBoa achieves high efficiency by fully utilized every node's available bandwidth.Distributed query is very important to global storage system. The thesis brings out a distributed query algorithm, Pb-link tree, which builds distributed index under p2p environment. Pb-link tree has high reliability, high throughput rate, low networking cost, load balance. It is adaptive to p2p environment better than pervious distributed query algorithm. Pb-link tree's networking cost is traditional algorithm's 20 percent. The query performance is 7 times to traditional ones. About 85 percent of query operation is correct under 50 percent node crushing.
Keywords/Search Tags:Global storage, Object storage, Peer-to-peer routing, Distributed query
PDF Full Text Request
Related items