Font Size: a A A

Range Of Query-based Structured P2p Overlay Network Design And Analysis

Posted on:2010-10-03Degree:MasterType:Thesis
Country:ChinaCandidate:F WangFull Text:PDF
GTID:2208360275955191Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
The extensive use of P2P systems in applications motivates the evolution of current P2P technologies.With the continuous increase in applications,data query is not only limited in the primary single keyword or the exact matches.The support for complex queries,such as range queries,prefix queries and aggregation queries,over structured peer-to-peer systems is currently an active and significant topic of research.Complex query is more complicated in P2P systems due to the volatility and scale of these systems.Most traditional structured P2P overlay network are constructed based on the distributed hash table technology,which also called DHT.This technology can help the system to search resource efficiently and solve the load balancing problem.However,its data order might be destroyed and make it difficult to realize the range queries in these systems.In order to solve this problem,a non-DHT based system has been proposed.In addition,reform and modification of those traditional P2P networks is also a desirable way.De Bruijn digraph is a special graph structure,it has characteristics like constant degree and optimal network diameter.We design a DBST overlay network by using multiple layer suffix tree and De Bruijn digraph.This network not only has the good points of tree structures in reserving data order property,which allows range queries in the system,but also has the advantages of constant degree of De Bruijn graph in the static network.It provides a range query method to that De Bruijn graph-based structured P2P overlay networks.Skip graph is a structure that supports range,query itself.It is a deformation of tree structures,and data order can be preserved in this structure.What's more,nodes in this network are all have duplications which could efficiently enhance the fault tolerance performance of the network.By using this graph,we structure a non-DHT based overlay network,which we called SGPO,it is a skip graph based P2P network which also supports topology-aware routing.Over the design of this system,we resolved the range query problem,as well as the inconsistency between physical network and logical topology in the P2P systems.In this paper,we mainly design and analyze some structured P2P overlays networks which support range queries.The content is divided into five chapters.In the first chapter,we give an illustration of the study background,the problem we put forward,the work we do,and also the structure of this paper;The second chapter is an overview of existing methods that are used in the solution of range query problem;In the third chapter we design a De Bruijn based multiple layer suffix tree P2P overlay network(DBST);In the fourth chapter we structure a skip graph-based geographical proximity overlay for P2P systems which support range query(SGPO);The last chapter is a conclusion and presents the future study trends.
Keywords/Search Tags:Peer-to-Peer Networks, structured overlay network, range query, De Bruijn digraph, constant degree, skip graph, topology-aware routing
PDF Full Text Request
Related items