The Research Of The Network Routing Algorithm Based On P2P

Compared with the traditional Client/Server network,P2P is a fully distributed network model, it is the system load balancing, robustness, scalability and cost-effective and so have an unparalleled advantage, in the distributed network research field,it become one of the hot.P2P topology constructed in accordance with generally can be divided into unstructured P2P and structured P2P into two categories, structured P2P scalability of its outstanding performance, becoming the mainstream of P2PThe P2P network route question is a P2P core question, This article in deep research P2P network route protocol, Proposed network topology model based on combination a binary sort tree with Chord ring. and proposed for the resource search algorithm for BBSTC network model. Based on the binary sort order traversal of the tree receive an ordered sequence of nodes, Binary search to satisfy a precondition for, This is a partial two-way query, with a clear direction. Authors propose a storage structure of binary tree improvement program. As father and son hierarchy of binary sort tree, Always has to go through layers of the parent node in order to cross-tree search,This leads to the upper node overload,So sort of binary tree structure of chain stores has been improved,Increased pointing to the root pointer domain,Therefore, upwards layer of nodes on the greatly reduced traffic,To improve the efficiency of network routing.Finally, several simulation tests can be seen, BBSTC model in message routing hops, the query efficiency, network churning-count and other important performance indicators are better than Chord model...