Layered message forwarding method suitable for non-full-link alliance chain network
By adopting hierarchical message forwarding method and dynamic meta-information clustering algorithm in non-linked alliance chain networks, the failure problem of traditional algorithms under special topology and information security is solved, broadcast efficiency is improved, network pressure is reduced, and complexity is adapted to Topology and dynamic cluster size.
Patent Information
- Application Number
- CN202411174658.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-26
- Publication Date
- 2024-11-29
- Estimated Expiration
- 2044-08-26
AI Technical Summary
In non-link consortium chain networks, traditional hierarchical broadcasting algorithms fail due to special topological structures and information security reasons, resulting in low broadcasting efficiency and high network pressure, and the K-mean algorithm is difficult to adapt to changes in dynamic cluster size.
Using the hierarchical message forwarding method, two rounds of clustering are clustered by pulling static and dynamic meta information, selecting representative nodes, and using ISODATA iterative self-organized clustering and Bloom filters to optimize the cluster structure, dynamically adjust the number of categories and clustering Center, reduce network burden.
It significantly improves the broadcast efficiency of non-link alliance chain networks, solves the problem of location information distortion caused by information security, supports custom clustering algorithms, adapts to complex topological structures, and reduces network pressure.
Smart Images

Figure CN119052158A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to a message forwarding method for a non-full-link alliance chain in the field of peer-to-peer networks at the bottom of blockchain, and in particular to a hierarchical message forwarding method suitable for a non-full-link alliance chain network. Background Art
[0002] The main application scenario of the consortium chain is specific business cooperation between institutions, such as supply chain finance and electronic forensics. By using the consortium chain, these institutions can jointly maintain a reliable database while ensuring the privacy and security of the data. Due to the special application scenario of the consortium chain, its consensus mechanism is different from the proof of work (PoW) and other methods of the public chain. The consortium chain usually uses consensus mechanisms such as Byzantine Fault Tolerance (BFT) and relies on leader election, voting algorithms and other methods to achieve consensus. The computing power overhead of BFT is much smaller than that of PoW, but the communication overhead of BFT is greatly affected by the size of the nodes and has poor scalability. Therefore, the consensus mechanism of the consortium chain does not require as much computing resources as the public chain, but the entire consensus process is highly dependent on the communication of the underlying distributed peer-to-peer network, and the performance of the underlying distributed peer-to-peer network also determines the performance upper limit of the entire consensus process.
[0003] Therefore, it is of great significance to study and optimize the underlying network model of the alliance chain. At present, there are few studies on distributed peer-to-peer networks in large-scale alliance chain network scenarios. Most of the research stays on the hierarchical broadcast of the public chain. Such research often uses clustering algorithms such as K-means for clustering, obtains location coordinates through IP information, allows nodes with similar physical locations to cluster, and selects the node at the center of the cluster as the representative node of the cluster, responsible for the broadcast within the cluster.
[0004] However, in the non-full-link scenario of the alliance chain, such algorithms often perform poorly or even fail. There are three reasons:
[0005] 1. Due to the special topology of the non-fully connected network, the node at the center of the physical location obtained by geographical location is not necessarily the most suitable node for broadcasting under this topology.
[0006] 2. Enterprises are usually reluctant to expose their internal topology information and use external proxies to communicate with other enterprises. If other enterprises only use the known proxy IP information to calculate the coordinates, the coordinates will be distorted, causing the traditional clustering algorithm to fail.
[0007] 3. The widely used K-means algorithm requires a preset K value, but a preset K value is difficult to estimate for a consortium chain cluster whose cluster size changes dynamically. Summary of the invention
[0008] The present invention aims to provide a hierarchical message forwarding method applicable to a non-full-link alliance chain network, which can effectively solve the problem of location information distortion caused by the special topological structure and information security caused by the non-full link, thereby causing the clustering algorithm relied on by the traditional hierarchical broadcast to fail. The method proposed in the present invention significantly improves the broadcast efficiency of the non-full-link alliance chain network and reduces the network pressure caused by large-scale broadcasting.
[0009] In order to achieve the above object, the present invention adopts the following technical solutions:
[0010] 1. A hierarchical message forwarding method suitable for non-fully linked consortium chain networks
[0011] S1: After the alliance chain network is started, each node starts to pull the static meta information of each node in the alliance chain network. The static meta information includes IP address and public key;
[0012] S2: Based on the static meta information of the pulled nodes, each node will locally cluster all nodes in the consortium chain network at least once to obtain multiple primary clusters and secondary clusters corresponding to the primary clusters;
[0013] S3: Each node performs intra-cluster learning in its cluster, specifically by establishing links and delay tests with other nodes in the cluster to obtain the dynamic meta-information of the current node;
[0014] S4: Each node will periodically pull the dynamic meta information of each node in the alliance chain network; after each node pulls the dynamic meta information of a preset number of nodes, each node determines the representative nodes in other first-level clusters and establishes links with each representative node;
[0015] S5: Each node sends a broadcast message to the representative node of each first-level cluster, and each representative node forwards the broadcast message to other nodes in the cluster where the representative node is located.
[0016] In S1, the pulling method of each node is that each node sends a PULL instruction to its adjacent node, and the adjacent node returns the latest static meta information it has to the current node as a response.
[0017] The S2 is specifically:
[0018] S2.1: After each node pulls the static meta information of a preset number of nodes, each node will use the coordinate information obtained from the IP address of the static meta information locally as an input parameter and perform the first round of clustering, dividing all nodes in the alliance chain network into multiple first-level clusters according to the distance of the coordinate information;
[0019] S2.2: If each primary cluster meets the secondary clustering condition, perform secondary clustering on the primary cluster to obtain a number of corresponding secondary clusters; if not, execute S3.
[0020] The S2.1 is specifically:
[0021] Each node uses the IP address in the static meta-information of the node to query and obtain the coordinate information corresponding to each node, and then uses the coordinate information of all nodes in the alliance chain network as input to perform ISODATA iterative self-organizing clustering to obtain multiple first-level clusters.
[0022] In S2.2, if each primary cluster satisfies the secondary clustering condition, the primary cluster is secondary clustered to obtain a number of corresponding secondary clusters, including:
[0023] If each first-level cluster contains different alliances, the current first-level cluster is first divided according to the type of alliance to obtain clusters corresponding to different alliances; if the cluster corresponding to the alliance where the node is located does not have an internal clustering method, the clusters corresponding to different alliances are recorded as different second-level clusters; if the cluster corresponding to the alliance where the node is located has an internal clustering method, the clustering method is used to perform a second round of clustering on the cluster corresponding to the alliance where the node is located to obtain several second-level clusters.
[0024] The S3 is specifically:
[0025] Each node traverses other nodes in its cluster. For hosts that can establish direct links or complete communication through forwarding paths, each node obtains the public key of the host's corresponding node and adds it to the Bloom filter to generate the breadth parameter in the dynamic meta information;
[0026] For hosts that can establish direct links or complete communication through forwarding paths, each node sends heartbeat packets regularly and records the average round-trip delay to generate performance parameters in dynamic meta-information, thereby obtaining dynamic meta-information of each node.
[0027] In S4, each node pulls by sending a PULL instruction to its adjacent node, and the adjacent node returns the latest dynamic meta information it has to the current node as a response.
[0028] In S4, each node traverses each primary cluster in the stored clustering result, and selects several nodes in each primary cluster as representative nodes, so that the public keys of all nodes in the primary cluster can appear in the breadth parameter of at least one representative node.
[0029] In S4, if there are multiple groups of candidate representative nodes in the primary cluster, a group of candidate representative nodes with the best average delay is selected as the representative node according to the performance parameter.
[0030] 2. A computer device
[0031] The computer device includes a memory and a processor, the memory stores a computer program, and the processor implements the steps of the hierarchical message forwarding method of a non-full-link alliance chain when executing the computer program.
[0032] 3. A computer-readable storage medium
[0033] The computer-readable storage medium stores a computer program, which, when executed by a processor, implements the steps of the hierarchical message forwarding method of a non-full-link alliance chain.
[0034] IV. A COMPUTER PROGRAM PRODUCT
[0035] The computer program product includes a computer program / instruction, which, when executed by a processor, implements the steps of the hierarchical message forwarding method of a non-fully-linked alliance chain.
[0036] By adopting the above technical solution, the present invention has the following beneficial effects:
[0037] 1) Through two rounds of clustering, the problem of IP information and actual location distortion caused by many enterprises using proxy communication due to information security reasons in the alliance chain scenario is solved. At the same time, it supports customized clustering algorithms within the alliance to adapt to complex topological structures.
[0038] 2) By adding dynamic meta information, nodes can select representative nodes based on the dynamic meta information of nodes in other clusters, solving the problem of representative node selection and enabling nodes with stronger communication capabilities to be successfully elected as representative nodes responsible for intra-cluster broadcasting.
[0039] 3) ISODATA iterative self-organizing clustering can automatically adjust the number of categories and cluster centers during the clustering process, making the clustering results closer to the objective reality, and avoiding the influence of the initial number of clusters selected in advance by the K-means algorithm on the clustering results.
[0040] 4) The use of Bloom filter, a probabilistic data structure, can effectively compress the amount of dynamic metadata and significantly reduce the network burden on the premise that the upper-layer consensus protocol has node fault tolerance. BRIEF DESCRIPTION OF THE DRAWINGS
[0041] Figure 1 It is a flow chart of the present invention.
[0042] Figure 2 This is the network topology diagram for the implementation case. DETAILED DESCRIPTION
[0043] The present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are only used to illustrate and explain the present invention, and are not used to limit the present invention.
[0044] like Figure 1 As shown, the hierarchical message forwarding method applicable to a non-full-link alliance chain network proposed in the present invention includes the following steps:
[0045] S1: The topology of the alliance chain network is as follows Figure 2 As shown in the figure, after the alliance chain network is started, each node starts to pull the static meta information of each node in the alliance chain network. The static meta information includes IP address and public key.
[0046] In S1, the pulling method of each node is that each node sends a PULL instruction to its adjacent node, and the adjacent node returns the latest static meta-information it has to the current node as a response.
[0047] S2: Based on the static meta information of the pulled nodes, each node will locally cluster all nodes in the consortium chain network at least once to obtain multiple primary clusters and secondary clusters corresponding to the primary clusters;
[0048] S2 is specifically:
[0049] S2.1: After each node pulls the static meta information of a preset number of nodes, each node will use the coordinate information obtained from the IP address of the static meta information locally as an input parameter and perform the first round of clustering, dividing all nodes in the alliance chain network into multiple first-level clusters according to the distance of the coordinate information; the specific value of the preset number is set through the configuration file. In actual application scenarios, when the user wants to start quickly, the ratio of the preset number is set to a smaller value, and when the user wants more accurate clustering, the ratio of the preset number is set to a larger value.
[0050] S2.1 specifically:
[0051] Each node uses the IP address in the static meta-information of the node to query and obtain the specific coordinate information corresponding to each node, and then uses the coordinate information of all nodes in the alliance chain network as input to perform ISODATA iterative self-organizing clustering to obtain multiple first-level clusters.
[0052] In this embodiment, since enterprise A uses a proxy server to connect to external enterprises, in the first round of clustering results, the nodes within the enterprise are all clustered in cluster_0, rather than two clusters, Shenzhen and Beijing. The results after the first round of clustering are shown in Table 1 below.
[0053] Table 1 shows the results of the first round of clustering.
[0054] Node Number ip address Public Key Clustering results Real location A0 ip_proxy:port_0 key_a_0 cluster_0 Beijing A1 ip_proxy:port_1 key_a_1 cluster_0 Beijing A2 ip_proxy:port_2 key_a_2 cluster_0 Beijing A3 ip_proxy:port_3 key_a_3 cluster_0 Shenzhen A4 ip_proxy:port_4 key_a_4 cluster_0 Shenzhen A5 ip_proxy:port_5 key_a_5 cluster_0 Shenzhen B0 ip_b_0:port key_b_0 cluster_1 Seattle B1 ip_b_1:port key_b_1 cluster_1 Seattle B2 ip_b_2:port key_b_2 cluster_1 Seattle C0 ip_c_0:port key_c_0 cluster_2 London C1 ip_c_1:port key_c_1 cluster_2 London C2 ip_c_2:port key_c_2 cluster_2 London
[0055] S2.2: If each primary cluster meets the secondary clustering condition, perform secondary clustering on the primary cluster to obtain a number of corresponding secondary clusters; if not, execute S3.
[0056] If each primary cluster meets the secondary clustering condition, the primary cluster is secondary clustered to obtain several corresponding secondary clusters, including:
[0057] If each first-level cluster contains different alliances, the current first-level cluster is first divided according to the type of alliance to obtain clusters corresponding to different alliances; if the cluster corresponding to the alliance where the node is located does not have an internal clustering method, the clusters corresponding to different alliances are recorded as different second-level clusters; if the cluster corresponding to the alliance where the node is located has an internal clustering method, the clustering method is used to perform a second round of clustering on the cluster corresponding to the alliance where the node is located to obtain several second-level clusters, that is, the nodes in the current cluster are further subdivided into several second-level clusters.
[0058] In this embodiment, the nodes in enterprise A perform the second round of clustering, using the enterprise's internal customized clustering based on the location information of the computer room to complete the internal second round of clustering. In the clustering results, A0, A1, A2 become a cluster, A3, A4, A5 become a cluster, and the nodes of other companies will not perform the second round of clustering. The following table 2 shows the results of the second round of clustering of the internal nodes of enterprise A running locally, and the nodes of other companies still maintain the results of the first round of clustering.
[0059] Table 2 is the second round of clustering results
[0060]
[0061]
[0062] S3: Each node performs intra-cluster learning in its cluster. If each node has only one primary cluster, it performs intra-cluster learning in the primary cluster. If there is a secondary cluster, it performs intra-cluster learning in the primary cluster. Specifically, it establishes links with other nodes in the cluster and performs delay tests to obtain the dynamic meta-information of the current node, including performance parameters and breadth parameters.
[0063] S3 is specifically:
[0064] Each node traverses other nodes in its cluster. For hosts that can establish direct links or complete communication through forwarding paths, each node obtains the public key of the node corresponding to the host and adds it to the Bloom filter to generate the breadth parameter in the dynamic meta-information.
[0065] For hosts that can establish direct links or complete communication through forwarding paths, each node sends heartbeat packets regularly and records the average round-trip delay to generate performance parameters in dynamic meta-information, thereby obtaining dynamic meta-information of each node.
[0066] The meta information table maintained by the nodes in enterprise A is shown in Table 3, and the meta information table maintained by the nodes in enterprises B and C is shown in Table 4. The nodes in enterprises B and C do not know that the nodes in enterprise A have undergone the second round of clustering, and still regard the nodes in enterprise A as belonging to the same cluster.
[0067] Table 3 is the information table of local storage of nodes A0~A5
[0068] Node Number ip address Public Key Performance parameters Breadth parameter Clustering results Real location A0 ip_proxy:port_0 key_a_0 5ms bloom_a_0 cluster_00 Beijing A1 ip_proxy:port_1 key_a_1 10ms bloom_a_1 cluster_00 Beijing A2 ip_proxy:port_2 key_a_2 2ms bloom_a_2 cluster_00 Beijing A3 ip_proxy:port_3 key_a_3 20ms bloom_a_3 cluster_01 Shenzhen A4 ip_proxy:port_4 key_a_4 10ms bloom_a_4 cluster_01 Shenzhen A5 ip_proxy:port_5 key_a_5 20ms bloom_a_5 cluster_01 Shenzhen B0 ip_b_0:port key_b_0 5ms bloom_b_0 cluster_1 Seattle B1 ip_b_1:port key_b_1 10ms bloom_b_1 cluster_1 Seattle B2 ip_b_2:port key_b_2 10ms bloom_b_2 cluster_1 Seattle C0 ip_c_0:port key_c_0 5ms bloom_c_0 cluster_2 London C1 ip_c_1:port key_c_1 10ms bloom_c_1 cluster_2 London C2 ip_c_2:port key_c_2 10ms bloom_c_2 cluster_2 London
[0069] Table 4 is the information table of local storage of nodes B0~B2 and C0~C2
[0070] Node Number ip address Public Key Performance parameters Breadth parameter Clustering results Real location A0 ip_proxy:port_0 key_a_0 5ms bloom_a_0 cluster_0 Beijing A1 ip_proxy:port_1 key_a_1 10ms bloom_a_1 cluster_0 Beijing A2 ip_proxy:port_2 key_a_2 2ms bloom_a_2 cluster_0 Beijing A3 ip_proxy:port_3 key_a_3 20ms bloom_a_3 cluster_0 Shenzhen A4 ip_proxy:port_4 key_a_4 10ms bloom_a_4 cluster_0 Shenzhen A5 ip_proxy:port_5 key_a_5 20ms bloom_a_5 cluster_0 Shenzhen B0 ip_b_0:port key_b_0 5ms bloom_b_0 cluster_1 Seattle B1 ip_b_1:port key_b_1 10ms bloom_b_1 cluster_1 Seattle B2 ip_b_2:port key_b_2 10ms bloom_b_2 cluster_1 Seattle C0 ip_c_0:port key_c_0 5ms bloom_c_0 cluster_2 London C1 ip_c_1:port key_c_1 10ms bloom_c_1 cluster_2 London C2 ip_c_2:port key_c_2 10ms bloom_c_2 cluster_2 London
[0071] S4: Each node will periodically pull the dynamic meta information of each node in the alliance chain network. The dynamic meta information includes performance parameters and breadth parameters, etc., which are used as data indicators for selecting representative nodes of the cluster. After each node pulls the dynamic meta information of several nodes, each node determines the representative nodes in other first-level clusters and establishes links with each representative node. Specifically, the nodes with higher performance parameters and breadth parameters in other first-level clusters will be regarded as representative nodes of the cluster.
[0072] In S4, each node pulls by sending a PULL instruction to its adjacent node, and the adjacent node returns the latest dynamic meta information it has to the current node as a response.
[0073] In S4, each node traverses each first-level cluster in the clustering results stored in it, and selects a preset number of nodes in each first-level cluster as representative nodes, so that the public keys of all nodes in the first-level cluster can appear in the breadth parameter of at least one representative node. Among them, the specific value of the preset number is set through a configuration file. In actual application scenarios, when the user wants to start quickly, the ratio of the preset number is set to be smaller. When the user wants more accurate clustering, the ratio of the preset number is set to be larger. If there are multiple groups of candidate representative nodes in the first-level cluster, a group of candidate representative nodes with the best average delay are selected as representative nodes based on performance parameters.
[0074] In this embodiment, in the information table stored locally in the nodes of enterprises B and C, A0 to A5 are still grouped together. However, according to the dynamic meta information, one node cannot cover all public keys. One node must be selected from A0 to A2 and A3 to A5 to complete the coverage. Therefore, enterprises B and C will select two representative nodes for enterprise A, and the selected nodes are A2 and A4 with high performance parameters. Similarly, nodes B0 and C0 are selected as representative nodes to be responsible for internal node broadcasting of enterprises B and C.
[0075] S5: Each node sends a broadcast message to the representative node of each first-level cluster, and each representative node forwards the broadcast message to other nodes in the cluster where the representative node is located.
[0076] An embodiment of the present invention provides a layered message forwarding device suitable for a non-full-link alliance chain network, including one or more processors, which are used to implement a layered message forwarding method suitable for a non-full-link alliance chain network in the above embodiment.
[0077] An embodiment of a hierarchical message forwarding device applicable to a non-full-link alliance chain network of the present invention can be applied to any device with data processing capabilities, and the device with data processing capabilities can be a device or apparatus such as a computer. The device embodiment can be implemented by software, or by hardware or a combination of software and hardware. Taking software implementation as an example, as a device in a logical sense, it is formed by the processor of any device with data processing capabilities in which it is located to read the corresponding computer program instructions in the non-volatile memory into the memory for execution. From the hardware level, it is a hardware structure diagram of any device with data processing capabilities where a hierarchical message forwarding device applicable to a non-full-link alliance chain network of the present invention is located. In addition to the processor, memory, network interface, and non-volatile memory, the manufacturing of any device with data processing capabilities in which the device in the embodiment is located is usually based on the actual function of the device with data processing capabilities. Other hardware may also be included, which will not be repeated.
[0078] The implementation process of the functions and effects of each unit in the above-mentioned device is specifically described in the implementation process of the corresponding steps in the above-mentioned method, and will not be repeated here.
[0079] The technical features of the above-described embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the technical features in the above-described embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.
[0080] An embodiment of the present invention also provides a readable storage medium on which a program is stored. When the program is executed by a processor, a hierarchical message forwarding method suitable for a non-fully-linked alliance chain network in the above embodiment is implemented.
[0081] The readable storage medium may be an internal storage unit of any device with data processing capability described in any of the aforementioned embodiments, such as a hard disk or a memory. The readable storage medium may also be an external storage device, such as a plug-in hard disk, a smart memory card (Smart Media Card, SMC), an SD card, a flash card (Flash Card), etc. equipped on the device. Furthermore, the readable storage medium may also include both an internal storage unit of any device with data processing capability and an external storage device. The readable storage medium is used to store the computer program and other programs and data required by any device with data processing capability, and may also be used to temporarily store data that has been output or is to be output.
[0082] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.
Claims
1. A hierarchical message forwarding method applicable to a non-fully linked alliance chain network, characterized in that: The following steps are involved: S1: After the alliance chain network is started, each node starts to pull the static meta information of each node in the alliance chain network. The static meta information includes IP address and public key; S2: Based on the static meta information of the pulled nodes, each node will locally cluster all nodes in the consortium chain network at least once to obtain multiple primary clusters and secondary clusters corresponding to the primary clusters; S3: Each node performs intra-cluster learning in its cluster, specifically by establishing links and delay tests with other nodes in the cluster to obtain the dynamic meta-information of the current node; S4: Each node will periodically pull the dynamic meta information of each node in the alliance chain network; after each node pulls the dynamic meta information of a preset number of nodes, each node determines the representative nodes in other first-level clusters and establishes links with each representative node; S5: Each node sends a broadcast message to the representative node of each first-level cluster, and each representative node forwards the broadcast message to other nodes in the cluster where the representative node is located.
2. According to claim 1, a hierarchical message forwarding method applicable to a non-full-link alliance chain network is characterized in that: In S1, the pulling method of each node is that each node sends a PULL instruction to its adjacent node, and the adjacent node returns the latest static meta information it has to the current node as a response.
3. According to claim 1, a hierarchical message forwarding method applicable to a non-full-link alliance chain network is characterized in that: The S2 is specifically: S2.1: After each node pulls the static meta information of a preset number of nodes, each node will use the coordinate information obtained from the IP address of the static meta information locally as an input parameter and perform the first round of clustering, dividing all nodes in the alliance chain network into multiple first-level clusters according to the distance of the coordinate information; S2.2: If each primary cluster meets the secondary clustering condition, perform secondary clustering on the primary cluster to obtain a number of corresponding secondary clusters; if not, execute S3.
4. A hierarchical message forwarding method applicable to a non-full-link alliance chain network according to claim 3, characterized in that: The S2.1 is specifically: Each node uses the IP address in the static meta-information of the node to query and obtain the coordinate information corresponding to each node, and then uses the coordinate information of all nodes in the alliance chain network as input to perform ISODATA iterative self-organizing clustering to obtain multiple first-level clusters.
5. According to claim 3, a hierarchical message forwarding method applicable to a non-full-link alliance chain network is characterized in that: In S2.2, if each primary cluster satisfies the secondary clustering condition, the primary cluster is secondary clustered to obtain a number of corresponding secondary clusters, including: If each first-level cluster contains different alliances, the current first-level cluster is first divided according to the type of alliance to obtain clusters corresponding to different alliances; if the cluster corresponding to the alliance where the node is located does not have an internal clustering method, the clusters corresponding to different alliances are recorded as different second-level clusters; if the cluster corresponding to the alliance where the node is located has an internal clustering method, the clustering method is used to perform a second round of clustering on the cluster corresponding to the alliance where the node is located to obtain several second-level clusters.
6. A hierarchical message forwarding method applicable to a non-full-link alliance chain network according to claim 1, characterized in that: The S3 is specifically: Each node traverses other nodes in its cluster. For hosts that can establish direct links or complete communication through forwarding paths, each node obtains the public key of the host's corresponding node and adds it to the Bloom filter to generate the breadth parameter in the dynamic meta information; For hosts that can establish direct links or complete communication through forwarding paths, each node sends heartbeat packets regularly and records the average round-trip delay to generate performance parameters in dynamic meta-information, thereby obtaining dynamic meta-information of each node.
7. A hierarchical message forwarding method applicable to a non-full-link alliance chain network according to claim 1, characterized in that: In S4, each node pulls by sending a PULL instruction to its adjacent node, and the adjacent node returns the latest dynamic meta information it has to the current node as a response.
8. A hierarchical message forwarding method applicable to a non-full-link alliance chain network according to claim 1, characterized in that: In S4, each node traverses each primary cluster in the stored clustering result, and selects several nodes in each primary cluster as representative nodes, so that the public keys of all nodes in the primary cluster can appear in the breadth parameter of at least one representative node.
9. A hierarchical message forwarding method applicable to a non-full-link alliance chain network according to claim 8, characterized in that: In S4, if there are multiple groups of candidate representative nodes in the primary cluster, a group of candidate representative nodes with the best average delay is selected as the representative node according to the performance parameter.
10. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 9 are implemented.
Citation Information
Patent Citations
Blockchain network connection method and device
CN112954074A
Distributed cloud storage data access method and data service system
CN114598717A
Block chain-based multilevel divide-and-conquer network topology construction method
CN116800766A
Method for selecting cluster head in distributed network, node, and system
WO2018098759A1
