CN115842741A - Method for evaluating cluster information propagation capacity under peer-to-peer network - Google Patents

Abstract

The invention discloses a method for evaluating cluster information propagation capacity in a peer-to-peer network, wherein the peer-to-peer network comprises the following steps: the cluster formed by the nodes carries out information interaction through a peer-to-peer network, and the nodes comprise: the controller triggers the first information receiving node to generate information F _w (1) And recording the time t for sending information by the first information receiving node ₁ And each node receives time t _{Harvesting machine} The peer-to-peer network appoints a single-source information receiving node and a multi-source information receiving node to send out information F at the time of delay time dt after receiving the information _w (n), dt is the forwarding period, n is the forwarding times, the information propagation efficiency eta of the forwarding node is calculated by a formula,

Description

Evaluation Method of Cluster Information Propagation Capability in Peer-to-Peer Network

technical field

The invention belongs to the field of information dissemination algorithms and evaluation algorithms, and in particular relates to an information dissemination ability verification and analysis evaluation algorithm of a cluster under a peer-to-peer network.

Background technique

Information dissemination is one of the important supports for clusters to perform tasks collaboratively. The mode of information dissemination is limited network, enumeration network, non-central peer-to-peer network and other modes. Since the non-central peer-to-peer mode is based on network topology, all nodes are peer-to-peer structures, which are simple, flexible, and easy to expand. In the cluster information dissemination Medium is a very important pattern. In this mode, each node traverses the entire network by connecting with adjacent peer nodes, and the nodes directly interact with each other to achieve information equivalence, information cohesion, and role equivalence, which greatly improves the efficiency of resource sharing and information transmission. efficiency.

However, the emergence effect of cluster information dissemination brought about by the decentralized peer-to-peer model makes cluster information dissemination processing and verification methods lacking, making it difficult to quantify and evaluate, and it is difficult to determine weak points or obstacles in the communication network.

Contents of the invention

In order to solve the problem that it is difficult to verify and evaluate the information dissemination ability of the cluster under the peer-to-peer network, the purpose of the invention of this application is to provide a verification and analysis evaluation algorithm for the information dissemination ability of the cluster under the peer-to-peer network. The information distribution and expansion algorithm of each node in the cluster, simple encoding of digital signals, decoupling of emergence, and realization of the verification of cluster communication capabilities and quantitative evaluation of communication efficiency.

In order to complete the invention purpose of the application, the application adopts the following technical solutions:

A method for evaluating cluster information dissemination capability under a peer-to-peer network of the present invention, the peer-to-peer network includes: m nodes and controllers, wherein m≥3, each node forms a cluster, and they exchange information through the peer-to-peer network , the nodes include: the first information receiving node, the single-source information receiving node and the multi-source information receiving node, the controller triggers the first information receiving node to generate information F _w (1) and records the time t ₁ and each node _receiving time t, the peer-to-peer network agrees that the single-source information receiving node and the multi-source information receiving node send the above information F _w (n) at the delay time dt after receiving the information, where dt is the forwarding cycle and n is the information verification The value is the number of forwarding times. If the above-mentioned information F _w (n) does not exist before the single-source information receiving node and the multi-source information receiving node, then F _w (n) is regarded as the effective receiving amount, where:

(a), the first information receiving node broadcasts information F _w (1)

When there is no information in the peer-to-peer network, the information check value n=0; the controller triggers a first message receiving node to send a message at time _t1 , and the first message receiving node information will be the information check value of F _w (n) n=0 becomes n=1, and broadcasts information F _w (1);

(b), Single-source information receiving node information processing and forwarding mechanism

Assuming that the single-source information receiving node only receives the information F _w (n) during the period _from t _to t + dt, and the _single -source information _receiving node does not have the above information F _w (n) before the period from t to t + dt , then the single-source information receiving node changes the check value n _in F _w (n) to 1+n, n is 2, 3, 4... _; broadcast outward;

(c), multi-source information receiving node information processing and forwarding mechanism

If the multi-source information receiving node receives several F _w (n-1), F _w (n), F _w (n+1)... the same information for the first time during the period _from t to _t + dt, compare n -1, n, n+1... the size of the check value, the multi-source information receiving node will broadcast the information Fw(n) to the outside at the time t _received to t _received + dt after the minimum check value + 1, n is the minimum check value + 1, that is, the number of forwarding stages of the above-mentioned multi-source information receiving node (Z _k ), n is 2, 3, 4...;

(d), calculate the information dissemination efficiency η

The information propagation efficiency η of single-source information receiving node and multi-source information receiving node is calculated by formula (1),

In the formula, n is the check value broadcast by the single-source information receiving node and the multi-source information receiving node, that is, the number of forwarding times;

m is the total number of cluster nodes;

Δt is the total delay of information dissemination, Δt= _t +dt-t ₁ , t is the time _for single-source information receiving node or multi-source information receiving node to receive information, t ₁ is the time for the first information receiving node to send information, dt is the forwarding cycle;

The smaller the value of information dissemination efficiency η is, the stronger its dissemination ability is.

In the method for evaluating the cluster information dissemination capability under the peer-to-peer network of the present invention, the effective received amount is information that has not been received before.

The method for evaluating cluster information dissemination capability under the peer-to-peer network of the present invention, wherein: in step (b) and step (c), if the above-mentioned information F _w (n) has existed before, the first information receiving node, unit The source information receiving node and the multi-source information receiving node do not broadcast the above information F _w (n).

The evaluation method of the cluster information dissemination capability under the peer-to-peer network of the present invention has the following advantages:

(1) The application of this method is not limited to the cluster node information transmission configuration, and can be applied to chain and star networks, especially suitable for decentralized peer-to-peer networks;

(2) The application of this method is not limited to the number of cluster nodes and the number of information distribution and transmission stages.

(3) The application of this method is not limited to specifying the pointing end and receiving end, each node in the cluster can be in duplex mode, and the pointing end and receiving end can be any node in the cluster.

(4) The application of this method is not limited to the direction of information propagation, and information can be sent and received in all directions.

(5) For information dissemination efficiency η, the smaller the value, the higher the dissemination efficiency.

(6) If you want to improve the efficiency of information dissemination, you can change the layout of cluster nodes to achieve the number of information forwarding stages and reduce the multi-stage propagation delay.

(7) The propagation method realizes the emergent decoupling of cluster information propagation under the peer-to-peer network through simple coding operations of digital signals, and can be used as an information propagation distribution algorithm and propagation verification algorithm, with good flexibility and universal application sex.

(8) The information dissemination efficiency method is not limited to the size of the cluster, and the quantitative calculation of the dissemination efficiency is realized, and the method is simple; it can also be used to improve the information dissemination efficiency.

(9), the present invention increases the check value of the information, which can effectively record the times of forwarding.

Description of drawings

FIG. 1 is a schematic diagram of the relationship between nodes and controllers in the method for evaluating cluster information dissemination capability under a peer-to-peer network according to the present invention.

In Figure 1, the label 1 is the controller; the label 2 is the node; the label Z _w is the first information receiving node; the label Z _j is the single-source information receiving node; Z _k is the multi-source information receiving node.

Detailed ways

For the sake of clarity, the initial information receiving node, single-source information receiving node and multi-source information receiving node are defined first.

The first information receiving node refers to the information generation source node or the node that the network receives a certain information for the first time.

A single-source information node refers to a node that only receives one piece of information within a certain period of time.

A multi-source information node refers to a node that receives multiple pieces of information within a certain period of time.

First information receiving node, single-source information node and multi-source information node are random, they are not a specified node, there is only one first information receiving node in the cluster, single-source information node and multi-source information node can be one or more indivual.

As shown in Figure 1, the peer-to-peer network of the present invention includes: m nodes 2 and a controller 1, wherein m≥3, and each node 2 forms a cluster, and they perform information exchange through the peer-to-peer network. For the convenience of the following description, the The nodes are artificially divided into three categories, that is, node 2 includes: the first information receiving node Z _w , the single-source information receiving node Z _j and the multi-source information receiving node Z _k , and the controller 1 triggers the first information receiving node Z _w to generate information F _w ( 1) and record the time _t1 when the first information receiving node _sends the information and the receiving time t of each node, and the peer-to-peer network agrees on the delay time after the single-source information receiving node Z _j and the multi-source information receiving node Z _k receive the information The above information F _w (n) is sent out at time dt, dt is the forwarding period, and n is the information check value, which is the number of forwarding times. If the single-source information receiving node Z _j and the multi-source information receiving node Z _k do not have the above-mentioned information F _w before (n), then _Fw (n) is regarded as effective reception amount, the evaluation method of the cluster information dissemination capability under the peer-to-peer network of the present invention comprises the following steps:

(a), the initial information receiving node Z _w broadcasts information F _w (1)

When there is no information in the peer-to-peer network, the information check value n=0; the controller 1 triggers a first information receiving node _Zw to send a piece of information at time _t1 , and the information of the first information receiving node _Zw will be _Fw (n) The information check value n=0 becomes n=1, and the information F _w (1) is broadcast to the outside;

(b), single-source information receiving node Z _j information processing and forwarding mechanism

Assuming that the single-source information _receiving node Z _j only receives information F _w (n) during the period from t _to t + dt, and the single-source information _receiving node Z _j does not have the above information F before the period _from t to t + dt _w (n ₎ , then the single-source information receiving node Z _j changes the check value n in F _w (n) to 1+n, where n is 2, 3, 4...; _w (n+1) broadcasts outward;

(c), multi-source information receiving node Z _k information processing and forwarding mechanism

If the multi-source information receiving node Z _k receives several _Fw (n-1), _Fw (n), _Fw (n+1)... the same information for the first time during the period _from t _to t+dt, Comparing the size of n-1, n, n+1... check value, the multi-source information receiving node Z _k will add the minimum check value + 1, and _send the information Fw(n) from t _to t+dt Outward broadcast, n is the minimum check value + 1, that is, the number of forwarding stages of the above-mentioned multi-source information receiving node Z _k , n is 2, 3, 4...;

(d), calculate the information dissemination efficiency η

The information propagation efficiency η of the single-source information receiving node Z _j and the multi-source information receiving node Z _k is calculated by formula (1),

In the formula, n is the check value broadcast by the single-source information receiving node Z _j and the multi-source information receiving node Z _k , that is, the number of forwarding times;

m is the total number of cluster nodes;

Δt is the total time delay of information dissemination, Δt=t _received +dt-t ₁ , t _received is the time of receiving information from single-source information receiving node Z _j or multi-source information receiving node Z _k , t ₁ is the first information receiving node Z _w The time to send information, dt is the forwarding cycle;

The smaller the value of information dissemination efficiency η, the node 2 indicates that its dissemination ability is stronger.

In step (b) and step (c), if the above-mentioned information F _w (n) already existed before, the initial information receiving node Z _w , the single-source information receiving node Z _j and the multi-source information receiving node Z _k F _w (n) does not broadcast. When a multi-source information receiving node Z _k forwards the information, the first information receiving node Z _w , the single-source information receiving node Z _j and other multi-source information receiving nodes Z _k will receive the forwarding information again, but, because the first information receiving node Z _w , single-source information receiving node Z _j and multi-source information receiving node Z _k already have the above information F _w (n), the first information receiving node Z _w , single-source information receiving node Z _j and multi-source information receiving node Z _k The above information F _w (n) is not broadcast, and the information propagation efficiency η of the above-mentioned initial information receiving node Z _w , single-source information receiving node Z _j and multi-source information receiving node Z _k is no longer calculated.

The present invention can also have other multiple embodiments, without departing from the spirit and essence of the present invention, those skilled in the art can make various corresponding changes and deformations according to the present invention, but these changes and deformations should Belong to the protection scope of the claims of the present invention.

Claims (3)

1. A method for evaluating the propagation capacity of cluster information in a peer-to-peer network, the peer-to-peer network comprising: m nodes (2) and a controller (1), wherein m is more than or equal to 3, each node (2) forms a cluster, and the nodes carry out information interaction through a peer-to-peer network, and the nodes (2) comprise: first-sending information receiving node (Z) _w ) Single source information receiving node (Z) _j ) And a multi-source information receiving node (Z) _k ) The controller (1) triggers the first information receiving node (Z) _w ) Generating information F _w (1) And recording the time t of sending information by the first information receiving node ₁ And reception time t of each node _{Harvesting machine} Peer-to-peer network promises a single source information receiving node (Z) _j ) And a multi-source information receiving node (Z) _k ) At receiving messageSending the information F at the time point of delay time dt after rest _w (n), dt is the forwarding period, n is the information check value, namely the forwarding times, if the single source information receiving node (Z) _j ) And a multi-source information receiving node (Z) _k ) The information F does not exist before _w (n) then F _w (n) as an effective receiving amount, characterized in that:

(a) First sending information receiving node (Z) _w ) Broadcasting out information F _w (1)

When no information exists in the peer-to-peer network, the information check value n =0; the controller (1) is at t ₁ Triggering an initial message receiving node (Z) at a time _w ) Sending a message, first message receiving node (Z) _w ) Information will F _w The information check value n =0 of (n) becomes n =1, and the information F is broadcasted to the outside _w (1)；

(b) Single source information receiving node (Z) _j ) Information handling forwarding mechanism

Suppose a single source information receiving node (Z) _j ) At t _{Harvesting machine} To t _{Harvesting machine} The + dt period receives only information F _w (n) at t _{Harvesting machine} To t _{Harvesting machine} + dt periods, in which the single-source information receiving node (Z) has not previously existed the above-mentioned information F _w (n), then the single source information receiving node (Z) _j ) F is to be _w In (n), check value n is 1+ n, n is 2,3,4 \8230; and at t _{Harvesting machine} + dt time will information F _w (n + 1) broadcasting outwards;

(c) Multi-source information receiving node (Z) _k ) Information handling forwarding mechanism

If the multi-source information receiving node (Z) _k ) At t _{Harvesting machine} To t _{Harvesting machine} A + dt period, first receiving several F _w (n-1)、F _w (n)、F _w (n + 1) \8230; same information, comparing n-1, n +1 \8230; check value size, then multi-source information receiving node (Z) _k ) After the minimum check value +1, at t _{Harvesting machine} To t _{Harvesting machine} + dt time will information F _w (n) is broadcast outwards, n is the minimum check value +1, namely the multi-source information receiving node (Z) _k ) The forwarding level of the network is 2,3,4, 8230, 8230;

(d) Calculating information propagation efficiency eta

Single source information receiving node (Z) _j ) And a multi-source information receiving node (Z) _k ) The information propagation efficiency η of (a) is calculated by the equation (1),

wherein n is a single source information receiving node (Z) _j ) And a multi-source information receiving node (Z) _k ) Broadcasting the check value, namely the forwarding times;

m is the total number of the cluster nodes;

Δ t is total time delay of information propagation, Δ t = t _{Harvesting machine} +dt-t ₁ ，t _{Harvesting machine} As a single source information receiving node (Z) _j ) Or a multi-source information receiving node (Z) _k ) Time of receiving information, t ₁ For the first message receiving node (Z) _w ) The time of sending information, dt is the forwarding period;

the smaller the value of the information propagation efficiency eta is, the stronger the propagation capacity of the node (2) is.

2. The method for evaluating the cluster information dissemination ability under a peer-to-peer network according to claim 1, wherein: the effective received amount is information that was not received before this.

3. The method for evaluating the cluster information dissemination ability under a peer-to-peer network according to claim 2, wherein: in the steps (b) and (c), if the above-mentioned information F has existed before _w (n) first message receiving node (Z) _w ) Single source information receiving node (Z) _j ) And a multi-source information receiving node (Z) _k ) For the above information F _w (n) not broadcast.

Images