A Node Organization Method in P2P System

Abstract

The invention provides a node organization method in a P2P system. The method comprises the following steps: 1) operating the IP addresses of nodes with a hash algorithm and setting a node identifier;2) calculating the distance among the nodes with XOR operation in mathematics; 3) realizing concurrency addition in the case of new node addition by an index server; and 4) realizing a nearby route from a node route to target nodes by the index server. In the method, the index server stores information of part of the nodes in the system combined with the index server and a DHT technology, and concurrency addition is realized by the index server in the case of new node addition, thus improving the node addition speed; the nearby route is realized by the index server from the route to the target nodes, thus improving the routing speed of the nodes; and the nodes can still find out proper cooperative nodes by a DHT mode to obtain media data even though the index server fails, thus avoiding single-point failure and improving robustness of the system.

Description

Technical field [0001] The present invention relates to the field of computer networks, and more specifically, the present invention relates to a node organization method in a P2P system. Background technique [0002] In recent years, with the rapid development and popularization of the Internet, Peer-to-Peer (P2P) technology has quickly become a hot topic in the computer world. Fortune Magazine has even listed P2P as one of the four technologies affecting the future of the Internet. One. [0003] Compared with traditional distributed systems, P2P technology has unparalleled advantages. In the P2P system, the status of each node is equal, and it is both a resource acquirer and a resource provider. By making full use of the resources provided by user nodes, P2P technology has huge advantages in terms of scalability, fault tolerance, and resource utilization. At the same time, P2P technology also has broad application prospects. P2P applications in multiple fields such as resource...

AI Technical Summary

Problems solved by technology

In the case of a small system, the index server can quickly respond to the node's request; but as the system expands, the index server gradually becomes the bottleneck of the system, and the response time becomes unbearable

And this method also has the defect of single point of failure: if the index server fails, the entire system will not work properly

The DHT-based method can avoid the defect of single point of failure and achieve load balancing between each node; however, whether a new node joins the system or is routed to a specified target node, an average of logN / 2 hops is required, while at the application layer In the overlay network, nodes connected by logical links are often far apart on the physical network, which makes the DHT-based method have unacceptable delay

Images