Method for selecting certificate storage nodes and network node
A storage node and network node technology, applied in the field of P2P network communication, can solve the problems of increased reliable storage of certificates, difficulties, and difficulty for nodes to know network topology, performance, routing, etc., and achieve the effect of low overhead, simple execution, and reliable storage
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0040] In the solution provided by Embodiment 1 of the present invention, firstly, each node in the P2P network needs to maintain a list of neighbor nodes, and periodically exchange the information of these neighbor lists. The basic scheme is: first, set the node v i is a neighbor of node v. In the process of communicating with other nodes, node v points statistics to node v i the number of nodes. If there are m nodes pointing to node v within a set unit time period t i , we say node v i The local in-degree observed by node v at time period t is m. The idea of this scheme is that node v maintains a "memory" of the local in-degree of its neighbor nodes, and the local in-degree does not exceed the actual in-degree of the node at most. A node with a large in-degree actually has a large local in-degree in node v, because a node with a large local in-degree will be selected as its neighbor node by many other nodes, which also means that the performance of the node is better ...
Embodiment 2
[0067] In a specific embodiment, the specific algorithm of the scheme provided by the embodiment of the present invention can be expressed as follows:
[0068] Randomly select some nodes from the set Г(v) to form the set P(v); randomly select some nodes u except v from the set Г(v) of the neighbor table of node v i , u i ∈Г(v), to each selected node u i Send P(v).
[0069]
[0070] Among them, v i .Inset points to node v observed by node v i set of nodes, v i .Indeg is the node v observed by node v i local ingress.
[0071] In the above scheme, when receiving a neighbor list exchange message from node v, the processing of the message by node u mainly includes two steps: the first step is to process the part of the set P(v) that is already in Г(u) The second step is to add the nodes in the set P(v) that are not in Г(u) to Г(u).
Embodiment 3
[0073] Such as figure 2 As shown, it is a specific example provided by Embodiment 3 of the present invention, wherein the solid line represents the topology of the network before implementing the solution provided by the embodiment of the present invention, and the dotted line represents the increased after executing the algorithm described in the embodiment of the present invention Network Topology. Specifically, node E randomly selects a neighbor node G and randomly selects a set P(E) (see Table 2) from its own neighbor table (see Table 1), and transfers P(E) to node G. According to the specific algorithm in the above-mentioned embodiment 2, and referring to formula (1), node G will select node B and node C as new neighbor nodes according to a certain probability. Among them, the probability of selecting node B is (1+1) / (1+1+2+1)=2 / 5; the probability of selecting node C is (2+1) / (1+1+2+1)= 3 / 5. Accordingly, node G chooses whether to use node B and node C as its new neigh...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More