WO2022063013A1 - 一种区块链中选择目标节点的方法及装置 - Google Patents
一种区块链中选择目标节点的方法及装置 Download PDFInfo
- Publication number
- WO2022063013A1 WO2022063013A1 PCT/CN2021/118684 CN2021118684W WO2022063013A1 WO 2022063013 A1 WO2022063013 A1 WO 2022063013A1 CN 2021118684 W CN2021118684 W CN 2021118684W WO 2022063013 A1 WO2022063013 A1 WO 2022063013A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- node
- target
- candidate
- candidate node
- nodes
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 52
- 230000002596 correlated effect Effects 0.000 claims abstract description 8
- 230000008859 change Effects 0.000 claims description 19
- 230000008569 process Effects 0.000 claims description 18
- 230000007935 neutral effect Effects 0.000 claims description 12
- 230000000875 corresponding effect Effects 0.000 claims description 10
- 238000010586 diagram Methods 0.000 description 8
- 238000004590 computer program Methods 0.000 description 7
- 238000005516 engineering process Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 230000003993 interaction Effects 0.000 description 5
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000006399 behavior Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000001131 transforming effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1408—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
- H04L63/1416—Event detection, e.g. attack signature detection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Definitions
- the invention relates to the field of financial technology (Fintech), in particular to a method and device for selecting a target node in a blockchain.
- target nodes When conducting business operations through the blockchain, multiple target nodes are generally selected first, and then the target nodes process the business operations to obtain the processing results. After the processing results of each target node meet the consensus requirements, the processing results that meet the consensus requirements are fed back to the requester.
- the selection of target nodes needs to consider the influence of malicious nodes in quantity. Taking the blockchain running the PBFT (Practical Byzantine Fault Tolerance, Practical Byzantine Fault Tolerance) consensus algorithm as an example, if you need to query a certain information, you will only recognize that the information is true and correct after at least f+1 nodes have fed back the same information. , f is the allowed number of malicious nodes.
- PBFT Practical Byzantine Fault Tolerance
- Most of the existing target node selection schemes are sequential selection (eg, selection according to the order of the candidate node list), or random selection (eg, random selection of 25% of the candidate nodes as target nodes).
- the probability of each node being selected is fixed. Therefore, honest nodes and malicious nodes in the blockchain have the same probability of being selected.
- the consensus process may be too long, which delays the processing of business operations.
- Embodiments of the present invention provide a method and device for selecting a target node in a blockchain, which are used to distinguish the probability that a candidate node is selected as a target node, improve the efficiency of the target node in processing operation requests, and improve the selection of target nodes in the blockchain of intelligence.
- an embodiment of the present invention provides a method for selecting a target node in a blockchain, including:
- the h-1 reliability factor of each candidate node in the blockchain is determined according to the feedback results of each candidate node in the previous h-1 time ;
- the feedback result is positively correlated with the reliability factor;
- h is a positive integer;
- L target nodes of the hth time are determined
- the historical behavior of each candidate node is digitized by the reliability factor, and the probability that the candidate node is selected as the target node can be distinguished according to the reliability factor, which solves the problem that when the target node is selected, the candidate node is selected as the target node.
- the probability of the target node is the same.
- the reliability factor of each candidate node the probability of each candidate node being determined as the target node can be adaptively changed without manual intervention, which improves the adaptability of the blockchain to select target nodes.
- the L target nodes of the hth time are determined, including:
- each candidate node at the h-1th time determines the probability interval of each candidate node becoming the hth time target node
- the probability interval of each candidate node is determined by the reliability factor, and the candidate node of the probability interval corresponding to the random number is determined as the target node according to the method of generating the random number. It can be seen from this that the larger the probability interval is, the greater the probability of the corresponding candidate node being selected as the target node, so as to distinguish the probability of the candidate node being selected as the target node according to the change reliability factor, which solves the problem of selecting the target node.
- the candidate node has the same probability of being selected as the target node.
- the probability interval is determined according to the following formula (1);
- min is the minimum value of the probability interval for the i-th candidate node to become the h-th target node; is the ratio of the reliability factor of the first candidate node to the sum of the reliability factors of each candidate node to the sum of the ratios of the reliability factor of the i-1th candidate node to the sum of the reliability factors of each candidate node; max is The i-th candidate node becomes the maximum value of the probability interval of the h-th target node; ⁇ i (h) is the ratio of the reliability factor of the i-th candidate node to the sum of the reliability factors of each candidate node; i is positive Integer.
- the method further includes:
- the operation request is sent to the newly added target node, and it is determined that the newly added target node is based on the feedback result of the operation request, until at least K identical operation results exist in each target node.
- the determining of the L target nodes is based on the feedback result of the operation request, including:
- the updating of the hth reliability factor of each candidate node according to the feedback results of the L target nodes includes:
- the hth reliability factor of each candidate node is updated according to the h-1th reliability factor of each candidate node and the update change amount of each candidate node.
- the node type of each candidate node is determined according to the operation result based on the operation request, so as to determine the update change amount of each candidate node, and the reliability factors of different types of candidate nodes are updated according to the update change amount, so as to The probability of this discriminating candidate node being selected as the target node.
- determining the node type of each candidate node according to the target node based on the feedback result of the operation request including:
- Target nodes without feedback results and unselected candidate nodes are determined as neutral nodes.
- the update variation of each candidate node is determined according to the following formula (2);
- the difference in the transaction processing capability of each candidate node is determined according to the duration of the target node processing the operation request to obtain the operation result, that is, the efficiency of the blockchain node interaction is determined, and the node interaction is increased by the duration of the operation result.
- the reliability factor of candidate nodes with high efficiency, and then the reliability factor of candidate nodes for selecting high-efficiency and honest nodes is improved, and the probability of candidate nodes with high node interaction efficiency being determined as target nodes is improved adaptively, which improves the block The efficiency with which the chain selects the target node.
- k is the update coefficient
- ⁇ i (h) is the reliability factor of the ith candidate node at the h-th time
- ⁇ i (h-1) is the reliability factor of the i-th candidate node at the h-1th time
- ⁇ i (h) is the update variation of the ith candidate node
- D is the initial preset value
- the update coefficient k generally takes a value between 0 and 1, and the value used to suppress the increase of the reliability factor is too large. Avoid the problem that the candidate node with too small reliability factor cannot be selected due to too large reliability factor value.
- the method further includes:
- the reliability factor of the i-th candidate node at the h-th time is greater than the first threshold, set the reliability factor of the i-th candidate node at the h-th time as the first threshold;
- the reliability factor of the i-th candidate node at the h-th time is smaller than the second threshold, the reliability factor of the i-th candidate node at the h-th time is set as the second threshold.
- the probability of each candidate node becoming a target node is prevented from being too different, and a candidate with a low reliability factor due to downtime is prevented.
- an embodiment of the present invention provides an apparatus for selecting a target node in a blockchain, including:
- the obtaining module is used to obtain the reliability factor of each candidate node in the blockchain at the h-1th time; wherein, the reliability factor of each candidate node at the h-1th time is based on the first h-1 time of each candidate node.
- the feedback result is determined; the feedback result is positively correlated with the reliability factor; h is a positive integer;
- a processing module configured to determine the L target nodes of the hth time according to the reliability factors of the candidate nodes at the h-1th time;
- processing module is specifically used for:
- each candidate node at the h-1th time determines the probability interval of each candidate node becoming the hth time target node
- the probability interval is determined according to the following formula (1);
- min is the minimum value of the probability interval for the i-th candidate node to become the h-th target node; is the ratio of the reliability factor of the first candidate node to the sum of the reliability factors of each candidate node to the sum of the ratios of the reliability factor of the i-1th candidate node to the sum of the reliability factors of each candidate node; max is The i-th candidate node becomes the maximum value of the probability interval of the h-th target node; ⁇ i (h) is the ratio of the reliability factor of the i-th candidate node to the sum of the reliability factors of each candidate node; i is positive Integer.
- processing module is also used for:
- the operation request is sent to the newly added target node, and it is determined that the newly added target node is based on the feedback result of the operation request, until at least K identical operation results exist in each target node.
- processing module is specifically used for:
- the hth reliability factor of each candidate node is updated according to the h-1th reliability factor of each candidate node and the update change amount of each candidate node.
- processing module is specifically used for:
- Target nodes without feedback results and unselected candidate nodes are determined as neutral nodes.
- the update variation of each candidate node is determined according to the following formula (2);
- k is the update coefficient
- ⁇ i (h) is the reliability factor of the ith candidate node at the h-th time
- ⁇ i (h-1) is the reliability factor of the i-th candidate node at the h-1th time
- ⁇ i (h) is the update variation of the ith candidate node
- D is the initial preset value
- processing module is also used for:
- the reliability factor of the i-th candidate node at the h-th time is greater than the first threshold, set the reliability factor of the i-th candidate node at the h-th time as the first threshold;
- the reliability factor of the i-th candidate node at the h-th time is smaller than the second threshold, the reliability factor of the i-th candidate node at the h-th time is set as the second threshold.
- an embodiment of the present invention further provides a computing device, including:
- the processor is configured to call the program instructions stored in the memory, and execute the method for selecting a target node in the blockchain according to the obtained program.
- an embodiment of the present invention further provides a computer-readable storage medium, where the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are used to cause the computer to execute the above-mentioned selected target in the blockchain method of the node.
- FIG. 1 is a schematic diagram of a system architecture according to an embodiment of the present invention.
- FIG. 2 is a schematic flowchart of a method for selecting a target node in a blockchain according to an embodiment of the present invention
- FIG. 3 is a schematic structural diagram of an apparatus for selecting a target node in a blockchain according to an embodiment of the present invention.
- the methods generally include the following two methods:
- the problem in the solutions in the prior art is that the honest nodes and the malicious nodes in the blockchain have the same probability of being selected as the target node.
- the consensus process may be too long. Affects the efficiency of node interaction. For example, in the case where it is impossible to distinguish the malicious ones, after selecting the target nodes in a sequential or random manner, it may happen that query information is often sent to the malicious nodes in the target nodes to obtain erroneous information. Or send query information to a target node with poor performance, and it takes a long time to receive a reply from the node.
- the embodiments of the present invention provide a method for selecting a target node in a blockchain, so as to distinguish the probability of a node in the blockchain being selected as a target node, and improve the intelligence of the blockchain in selecting a target node.
- the specific implementation is as follows:
- FIG. 1 exemplarily shows a system architecture to which an embodiment of the present invention is applicable, where the system architecture includes a client 110 , a candidate node 120 , a candidate node 130 , and a candidate node 140 .
- the client 110 is a node in the blockchain. It should be noted that the nodes in the blockchain are not limited to the nodes that participate in the blockchain network consensus to maintain the ledger, but also include the client or SDK (Software Development Kit) that interacts with the blockchain.
- SDK Software Development Kit
- the candidate nodes are not limited to the nodes directly connected to the client 110 in the network topology, and may also be indirectly connected nodes.
- the client 110 is used to obtain the reliability factors of the candidate node 120, the candidate node 130 and the candidate node 140 at the h-1th time, and then determine that the candidate node 120, the candidate node 130 and the candidate node 140 become The probability interval of the hth target node. After the corresponding probability interval is obtained, a random number is generated, and the candidate node of the probability interval corresponding to the random number is determined as the h-th target node.
- the candidate node 130 and the candidate node 140 are determined as the target nodes, and then an operation request is sent to the target nodes (ie, the candidate node 130 and the candidate node 140), and the feedback result of the target node based on the operation request is determined, and then the candidate node is updated according to the feedback result.
- the reliability factor of node 120, candidate node 130 and candidate node 140 at the hth time is used to select the target node of the h+1-th time.
- the candidate node 120 , the candidate node 130 and the candidate node 140 are used to provide the client 110 with its own reliability factor at the h-1th time, and after receiving the operation request sent by the client 110 , send a feedback result.
- FIG. 1 the structure shown in FIG. 1 above is only an example, which is not limited in this embodiment of the present invention.
- FIG. 2 exemplarily shows a process of a method for selecting a target node in a blockchain provided by an embodiment of the present invention, and the process can be executed by an apparatus for selecting a target node in the blockchain.
- the process specifically includes:
- Step 201 Obtain the h-1th reliability factor of each candidate node in the blockchain.
- the h-1 th reliability factor of each candidate node is determined according to the feedback result of each candidate node in the previous h-1 time, and the feedback result is positively correlated with the reliability factor. For example, after the reliability factor is updated several times, the reliability factor of a candidate node with accurate feedback results and high efficiency increases.
- Step 202 according to the reliability factor of each candidate node at the h-1th time, determine the Lth target nodes of the hth time.
- the probability interval of each candidate node becoming the hth time target node is determined, and then according to each candidate node becoming the hth time target node The probability interval of determines the target node of the hth time.
- a probability interval for each candidate node to become the h-th target node is determined. Then, a random number is generated, and a candidate node in a probability interval corresponding to the random number is determined as the h-th target node. Finally, generate random numbers repeatedly until L target nodes that are not repeated are determined.
- the ratio of the reliability factor of each candidate node to the sum of the reliability factors of the candidate nodes is determined according to the reliability factor of each candidate node at the h-1th time, and the ratio is the selection of each candidate node. is the probability of the target node, and the probability interval of each candidate node becoming the h-th target node is determined according to the ratio.
- the probability interval is determined according to the following formula (1):
- min is the minimum value of the probability interval for the i-th candidate node to become the h-th target node; is the ratio of the reliability factor of the 1st candidate node to the sum of the reliability factors of the candidate nodes to the sum of the ratios of the reliability factor of the i-1th candidate node and the sum of the reliability factors of each candidate node; max is the ith The i candidate node becomes the maximum value of the probability interval of the h-th target node; ⁇ i (h) is the ratio of the reliability factor of the i-th candidate node to the sum of the reliability factors of each candidate node; i is a positive integer .
- the reliability factor of the candidate node A at the h-1th time is 24, the reliability factor of the candidate node B at the h-1th time is 1, and the reliability factor of the candidate node C at the h-1th time is 24, The reliability factor of candidate node D at the h-1th time is 1.
- Step 203 Send an operation request to the L target nodes, and determine the feedback results of the L target nodes based on the operation request.
- the feedback result includes an operation result fed back by the target node after processing the operation request based on the target node.
- the operation result fed back by the malicious node is inconsistent with the operation results fed back by other target nodes, so that the number of consistent operation results is less than the number threshold. At this time, a random number will be generated again to determine Added target node.
- K is not greater than L and is a positive integer. It should be noted that the number of the number thresholds K and L is determined according to the number of candidate nodes. For example, according to the PBFT consensus algorithm, K-1 needs to be greater than (number of candidate nodes-1)/3.
- the honest node in the target node cannot be determined, so it is necessary to generate random nodes again.
- the operation results of the target node E are inconsistent with the operation results of the target nodes F and G.
- Step 204 if there are at least K identical operation results that meet the consensus requirements in the feedback results of the L target nodes, update the h-th reliability of each candidate node according to the feedback results of the L target nodes. Sex factor.
- the node type of each candidate node is determined according to the same operation result, and then the node type of each candidate node is determined according to the same operation result.
- Type updates the reliability factor of each candidate node at the hth time.
- the node type of each candidate node is determined according to the operation result of the target node based on the operation request, and the node efficiency of the target node is determined according to the duration of the target node processing the operation request to obtain the operation result. It should be noted that, if the time period for the target node to process the operation request and obtain the operation result exceeds the time threshold, the reduction time length is set to the time threshold.
- the time threshold may be a value set based on experience, for example, a value of 0.5s and the like.
- the node types of the candidate nodes include honest nodes, malicious nodes and neutral nodes, and the node types of each candidate node are determined according to the same operation result.
- At least K target nodes with the same operation result are determined as honest nodes.
- the target node whose operation result is different from that of the honest node is determined as the malicious node.
- Target nodes without feedback results and unselected candidate nodes are determined as neutral nodes.
- the update change amount of each candidate node is determined according to the node type of each candidate node and the node efficiency of the target node. Then, the reliability factor of each candidate node at the h-th time is updated according to the reliability factor of each candidate node at the h-1th time and the update variation of each candidate node.
- ⁇ i (h) is the update change of the ith candidate node, is the node efficiency of the target node, C 1 is the adjustment value of the honest node, t i is the time period for the target node to process the operation request and get the operation result, T 1 is the type of the honest node, C 2 is the adjustment value of the malicious node, T 2 is the The type of the malicious node, T3 is the type of the neutral node.
- C 1 and C 2 are values that can be set based on experience, for example, values of 12, 5, and so on.
- the node performance of the honest node is determined according to the duration of the target node processing the operation request to obtain the operation result, so that the update change amount of the honest node with high performance (ie short duration) is greater than that of the honest node with low performance (ie long duration).
- the update change amount of the node to distinguish the performance difference of honest nodes (that is, to distinguish the efficiency of honest nodes processing operation requests).
- k is the update coefficient
- ⁇ i (h) is the reliability factor of the ith candidate node at the h-th time
- ⁇ i (h-1) is the reliability factor of the i-th candidate node at the h-1th time
- ⁇ i (h) is the update variation of the ith candidate node
- D is the initial preset value. It should be noted that k generally takes a value between 0 and 1, and D is a value that can be set based on experience, for example, it can take a value of 10.
- the value of the hth reliability factor of each candidate node is set at the upper and lower thresholds .
- the reliability factor of the ith candidate node at the hth time is greater than the first threshold (upper threshold)
- the reliability factor of the ith candidate node at the hth time is set as the first threshold.
- the reliability factor of the i-th candidate node at the h-th time is less than the second threshold (lower threshold)
- the reliability factor of the i-th candidate node at the h-th time is set as the second threshold.
- the first threshold and the second threshold may be set according to experience, for example, the values may be 24, 1, or the like. It should be noted that the function of k is to reduce the magnitude of the increase or decrease of the reliability factor, so as to prevent the reliability factor from reaching the first threshold and the second threshold prematurely.
- each candidate node is randomly selected as the target node, and after multiple rounds of queries (that is, the value of h is large), the According to the updated reliability factor, the efficient honest node among the candidate nodes is determined.
- the probability of the efficient honest node being selected as the target node is increased, thereby improving the selection.
- Efficiency of the target node is selected through the probability interval, which increases the randomness and ensures the selection range; through the set update coefficient and the first threshold and the second threshold, the local optimal situation among the candidate nodes is avoided.
- the malicious nodes, downtime nodes and nodes with poor performance in the candidate nodes can be determined by the reliability factors corresponding to the candidate nodes, and it is no longer necessary to manually mark the malicious nodes, downtime nodes (target nodes without feedback results) and nodes with poor performance. node. Adaptively reduces the probability of the client interacting with malicious nodes, downtime nodes and nodes with poor performance, and improves the intelligence and efficiency of node interaction.
- candidate node 1 to candidate node 7 There are seven candidate nodes in a blockchain network, denoted as candidate node 1 to candidate node 7 respectively.
- K that meets the consensus requirement is 3 (that is, there are at least 3 identical operation results that meet the consensus requirement in the feedback results of the target node).
- the probability of being the target node is 1/7 ⁇ 0.142857.
- the probability interval for the first candidate node to become the first target node is (0, 0.142857]
- the probability interval for the second candidate node to become the first target node is (0.142857, 0.285714]
- the probability interval of the third candidate node becoming the first target node is (0.285714, 0.428571]
- the probability interval of the fourth candidate node becoming the first target node is (0.428571, 0.571429]
- the fifth candidate node The probability interval of becoming the first target node is (0.571429, 0.714286]
- the probability interval of the sixth candidate node becoming the first target node is (0.714286, 0.857143]
- the seventh candidate node becoming the first target is (0.857143, 1].
- candidate node 4 and candidate node 5 After sending the operation request to candidate node 1, candidate node 4 and candidate node 5, it is determined that the operation result of candidate node 1 is a, the duration is 0.1s, the operation result of candidate node 4 is b, the duration is 0.1s, and the operation result of candidate node 5 is no Operation result. Since the same number of operation results does not satisfy the value of K, a random number is generated again, the newly added target node is selected as candidate node 3, and an operation request is sent to candidate node 3, and the operation result of candidate node 3 is determined to be a, The duration is 0.2s.
- Candidate node number Operation result is it right or not Duration (the threshold of duration threshold is 0.5s) 1 a Yes 0.1s 3 a Yes 0.2s 4 b no 0.1s 5 without without without 6 a Yes 0.6s
- candidate node 1 candidate node 3 and candidate node 4 are honest nodes
- candidate node 4 is a malicious node
- candidate node 5 is a target node without feedback results
- candidate node 2 and candidate node 7 are neutral. node.
- the sex factor is as follows:
- the reliability factor of candidate node 1 at the first time is:
- the reliability factor of candidate node 2 at the first time is:
- the reliability factor of candidate node 3 at the first time is:
- the reliability factor of candidate node 4 at the first time is:
- the reliability factor of candidate node 5 in the first time is:
- the duration of the candidate node 6 exceeds the duration threshold, so the reliability factor of the candidate node 6 at the first time is:
- the reliability factor of candidate node 7 at the first time is:
- FIG. 3 exemplarily shows the structure of an apparatus for selecting a target node in a blockchain provided by an embodiment of the present invention, and the apparatus can execute the flow of a method for selecting a target node in the blockchain.
- the device specifically includes:
- the obtaining module 301 is used to obtain the reliability factor of each candidate node in the block chain at the h-1th time; wherein, the reliability factor of each candidate node at the h-1th time is based on the first h-1 of each candidate node.
- the feedback result of the second time is determined; the feedback result is positively correlated with the reliability factor; h is a positive integer;
- the processing module 302 is configured to determine the L target nodes of the hth time according to the reliability factor of each candidate node at the h-1th time;
- processing module 302 is specifically used for:
- each candidate node at the h-1th time determines the probability interval of each candidate node becoming the hth time target node
- the probability interval is determined according to the following formula (1);
- min is the minimum value of the probability interval for the i-th candidate node to become the h-th target node; is the ratio of the reliability factor of the first candidate node to the sum of the reliability factors of each candidate node to the sum of the ratios of the reliability factor of the i-1th candidate node to the sum of the reliability factors of each candidate node; max is The i-th candidate node becomes the maximum value of the probability interval of the h-th target node; ⁇ i (h) is the ratio of the reliability factor of the i-th candidate node to the sum of the reliability factors of each candidate node; i is positive Integer.
- processing module 302 is further configured to:
- the operation request is sent to the newly added target node, and it is determined that the newly added target node is based on the feedback result of the operation request, until at least K identical operation results exist in each target node.
- processing module 302 is specifically used for:
- the hth reliability factor of each candidate node is updated according to the h-1th reliability factor of each candidate node and the update change amount of each candidate node.
- processing module 302 is specifically used for:
- Target nodes without feedback results and unselected candidate nodes are determined as neutral nodes.
- the update variation of each candidate node is determined according to the following formula (2);
- k is the update coefficient
- ⁇ i (h) is the reliability factor of the ith candidate node at the h-th time
- ⁇ i (h-1) is the reliability factor of the i-th candidate node at the h-1th time
- ⁇ i (h) is the update variation of the ith candidate node
- D is the initial preset value
- processing module 302 is further configured to:
- the reliability factor of the i-th candidate node at the h-th time is greater than the first threshold, set the reliability factor of the i-th candidate node at the h-th time as the first threshold;
- the reliability factor of the i-th candidate node at the h-th time is smaller than the second threshold, the reliability factor of the i-th candidate node at the h-th time is set as the second threshold.
- an embodiment of the present invention also provides a computing device, including:
- the processor is configured to call the program instructions stored in the memory, and execute the method for selecting a target node in the blockchain according to the obtained program.
- an embodiment of the present invention further provides a computer-readable storage medium, where the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are used to cause a computer to execute the above-mentioned blockchain The method for selecting the target node.
- the embodiments of the present application may be provided as a method, a system, or a computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
- computer-usable storage media including, but not limited to, disk storage, CD-ROM, optical storage, etc.
- These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory result in an article of manufacture comprising instruction means, the instructions
- the apparatus implements the functions specified in the flow or flow of the flowcharts and/or the block or blocks of the block diagrams.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
本发明公开了一种区块链中选择目标节点的方法及装置，包括：获取区块链中各候选节点在第h-1次的可靠性因子。其中，第h-1次的可靠性因子是根据各候选节点在前h-1次的反馈结果确定的；反馈结果与可靠性因子正相关。再根据第h-1次的可靠性因子，确定出第h次的L个目标节点，并发送操作请求，然后确定基于操作请求的反馈结果，若反馈结果中存在满足共识要求的至少K个相同的操作结果，则更新第h次的可靠性因子。根据可靠性因子区分了候选节点被选择为目标节点的概率。因为可靠性因子与反馈结果正相关，所以提升了目标节点在处理操作请求时的效率。通过更新各候选节点的可靠性因子，提高了区块链选择目标节点的自适应性。
Description
相关申请的交叉引用
本申请要求在2020年09月23日提交中国专利局、申请号为202011007613.X、申请名称为“一种区块链中选择目标节点的方法及装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
本发明涉及金融科技(Fintech)领域，尤其涉及一种区块链中选择目标节点的方法及装置。
随着计算机技术的发展，越来越多的技术(例如：区块链、云计算或大数据)应用在金融领域，传统金融业正在逐步向金融科技转变，大数据技术也不例外，但由于金融、支付行业的安全性、实时性要求，也对大数据技术提出的更高的要求。
通过区块链进行业务操作时，一般是先选取多个目标节点，之后目标节点对业务操作进行处理，得到处理结果。在各目标节点的处理结果满足共识要求后，才将满足共识要求的处理结果反馈给请求方。目标节点的选取在数量上需要考虑作恶节点的影响。以运行PBFT(Practical Byzantine Fault Tolerance，实用拜占庭容错算法)共识算法的区块链为例，如需查询某个信息，则在获得最少f+1个节点反馈相同信息后，才认可信息是真实正确的，f为允许的作恶节点数。
现有的目标节点选择方案多为按序选择(如根据候选节点列表的顺序进行选择)，或随机选择(如随机选择候选节点中25％的节点作为目标节点)。在这两种方式中，每个节点被选中的概率固定不变。因而，区块链中的诚实节点和作恶节点被选择的概率是一样的。但是，在作恶节点被选为目标节点时，可能会存在共识过程过长，拖延了业务操作的处理过程。
发明内容
本发明实施例提供一种区块链中选择目标节点的方法及装置，用于区分候选节点被选为目标节点的概率，提升目标节点在处理操作请求时的效率，提高区块链选择目标节点的智能性。
第一方面，本发明实施例提供一种区块链中选择目标节点的方法，包括：
获取区块链中各候选节点在第h-1次的可靠性因子；其中，各候选节点的第h-1次的可靠性因子是根据各候选节点在前h-1次的反馈结果确定的；反馈结果与可靠性因子正相关；h为正整数；
根据所述各候选节点在第h-1次的可靠性因子，确定出第h次的L个目标节点；
向所述L个目标节点发送操作请求，并确定所述L个目标节点基于所述操作请求的反馈结果；
若所述L个目标节点的反馈结果中存在满足共识要求的至少K个相同的操作结果，则根据所述L个目标节点的反馈结果更新所述各候选节点在第h次的可靠性因子；K不大于L且均为正整数。
上述技术方案中，通过可靠性因子对各候选节点历史行为进行数据化的体现，且根据可靠性因子可以区分候选节点被选为目标节点的概率，解决了选择目标节点时，候选节点被选为目标节点的概率相同的问题。同时，根据可靠性因子与反馈结果正相关，提升了目标节点在处理操作请求时的效率。最后，通过更新各候选节点的可靠性因子，实现自适应的改变各候选节点被确定为目标节点的概率，不需人工干预，提高了区块链选择目标节点的自适应性。
可选的，所述根据所述各候选节点在第h-1次的可靠性因子，确定出第h次的L个目标节点，包括：
根据所述各候选节点在第h-1次的可靠性因子，确定每个候选节点成为第h次的目标节点的概率区间；
生成随机数，将与所述随机数对应的概率区间的候选节点确定为第h次的目标节点；
重复生成随机数，直至确定出不重复的L个目标节点。
上述技术方案中，通过可靠性因子确定出每个候选节点的概率区间，根据生成随机数的方法，将随机数对应的概率区间的候选节点确定为目标节点。由此可以看出，概率区间范围越大，对应的候选节点被选中目标节点的概率越大，以此根据改变可靠性因子区分候选节点被选为目标节点的概率，解决了选择目标节点时，候选节点被选为目标节点的概率相同的问题。
可选的，根据下述公式(1)确定出所述概率区间；
其中，min为第i个候选节点成为第h次的目标节点的概率区间的最小值；
为第1个候选节点的可靠性因子与各候选节点的可靠性因子的总和的比值至第i-1个候选节点的可靠性因子与各候选节点的可靠性因子的总和的比值总和；max为第i个候选节点成为第h次的目标节点的概率区间的最大值；ρ
i(h)为第i个候选节点的可靠性因子与各候选节点的可靠性因子的总和的比值；i为正整数。
可选的，所述方法还包括：
若所述L个目标节点的反馈结果中不存在满足共识要求的至少K个相同的操作结果，则根据未选中的候选节点在第h-1次的可靠性因子，从所述未选中的候选节点中确定新增的目标节点；
向所述新增的目标节点发送所述操作请求，并确定所述新增的目标节点基于所述操作请求的反馈结果，直至各目标节点中存在至少K个相同的操作 结果。
可选的，所述确定所述L个目标节点基于所述操作请求的反馈结果，包括：
根据目标节点基于所述操作请求的操作结果，确定各候选节点的节点类型；
根据目标节点处理所述操作请求得到所述操作结果的时长，确定目标节点的节点效率；
所述根据所述L个目标节点的反馈结果更新所述各候选节点在第h次的可靠性因子，包括：
根据各候选节点的节点类型、目标节点的节点效率确定出所述各候选节点的更新变化量；
根据所述各候选节点在第h-1次的可靠性因子和所述各候选节点的更新变化量更新所述各候选节点在第h次的可靠性因子。
上述技术方案中，根据基于操作请求的操作结果，确定出各候选节点的节点类型，以此确定出各候选节点的更新变化量，根据更新变化量更新不同类型的候选节点的可靠性因子，以此区分候选节点被选为目标节点的概率。
可选的，所述根据目标节点基于所述操作请求的反馈结果，确定各候选节点的节点类型，包括：
将至少K个操作结果相同的目标节点确定为诚实节点；
将操作结果与诚实节点的操作结果不相同的目标节点确定为作恶节点；
将无反馈结果的目标节点以及未选中的候选节点确定为中性节点。
可选的，根据下述公式(2)确定出所述各候选节点的更新变化量；
其中，Δσ
i(h)为第i个候选节点的更新变化量；
为目标节点的节点效率；C
1为诚实节点的调整值；t
i为目标节点处理操作请求得到操作结果的时长；T
1为诚实节点的类型；C
2为作恶节点的调整值；T
2为作恶节点的类型；T
3为中性节点的类型。
上述技术方案中，根据目标节点处理操作请求得到操作结果的时长，确定出各候选节点的事务处理能力的差别，即确定出区块链节点交互的效率的高低，通过操作结果的时长增加节点交互效率高的候选节点的可靠性因子，进而提高选取高效率和诚实节点的候选节点的可靠性因子，实现自适应的提高节点交互效率高的候选节点被确定为目标节点的概率，提升了区块链选择目标节点的效率。
可选的，根据下述公式(3)更新所述各候选节点在第h次的可靠性因子；
其中，k为更新系数；σ
i(h)为第i个候选节点在第h次的可靠性因子；σ
i(h-1)为第i个候选节点在第h-1次的可靠性因子；Δσ
i(h)为第i个候选节点的更新变化量；D为初始预设值。
上述技术方案中，更新系数k一般取值在0-1之间，用于抑制可靠性因子增长的数值过大。避免可靠性因子数值过大导致的无法选中可靠性因子数值过小的候选节点的问题。
可选的，所述方法还包括：
若所述第i个候选节点在第h次的可靠性因子大于第一阈值，则将所述第i个候选节点在第h次的可靠性因子设置为所述第一阈值；
若所述第i个候选节点在第h次的可靠性因子小于第二阈值，则将所述第i个候选节点在第h次的可靠性因子设置为所述第二阈值。
上述技术方案中，通过将可靠性因子设置于第一阈值与第二阈值之间，防止了各候选节点成为目标节点的概率的差异过大，且使因宕机导致的可靠性因子低的候选节点存在成为目标节点的概率，实现自适应的确定候选节点成为目标节点的概率。
第二方面，本发明实施例提供一种区块链中选择目标节点的装置，包括：
获取模块，用于获取区块链中各候选节点在第h-1次的可靠性因子；其中，各候选节点的第h-1次的可靠性因子是根据各候选节点在前h-1次的反馈结果确定的；反馈结果与可靠性因子正相关；h为正整数；
处理模块，用于根据所述各候选节点在第h-1次的可靠性因子，确定出第h次的L个目标节点；
向所述L个目标节点发送操作请求，并确定所述L个目标节点基于所述操作请求的反馈结果；
若所述L个目标节点的反馈结果中存在满足共识要求的至少K个相同的操作结果，则根据所述L个目标节点的反馈结果更新所述各候选节点在第h次的可靠性因子；K不大于L且均为正整数。
可选的，所述处理模块具体用于：
根据所述各候选节点在第h-1次的可靠性因子，确定每个候选节点成为第h次的目标节点的概率区间；
生成随机数，将与所述随机数对应的概率区间的候选节点确定为第h次的目标节点；
重复生成随机数，直至确定出不重复的L个目标节点。
可选的，根据下述公式(1)确定出所述概率区间；
其中，min为第i个候选节点成为第h次的目标节点的概率区间的最小值；
为第1个候选节点的可靠性因子与各候选节点的可靠性因子的总和的比值至第i-1个候选节点的可靠性因子与各候选节点的可靠性因子的总和的比值总和；max为第i个候选节点成为第h次的目标节点的概率区间的最大值； ρ
i(h)为第i个候选节点的可靠性因子与各候选节点的可靠性因子的总和的比值；i为正整数。
可选的，所述处理模块还用于：
若所述L个目标节点的反馈结果中不存在满足共识要求的至少K个相同的操作结果，则根据未选中的候选节点在第h-1次的可靠性因子，从所述未选中的候选节点中确定新增的目标节点；
向所述新增的目标节点发送所述操作请求，并确定所述新增的目标节点基于所述操作请求的反馈结果，直至各目标节点中存在至少K个相同的操作结果。
可选的，所述处理模块具体用于：
根据目标节点基于所述操作请求的操作结果，确定各候选节点的节点类型；
根据目标节点处理所述操作请求得到所述操作结果的时长，确定目标节点的节点效率；
根据各候选节点的节点类型、目标节点的节点效率确定出所述各候选节点的更新变化量；
根据所述各候选节点在第h-1次的可靠性因子和所述各候选节点的更新变化量更新所述各候选节点在第h次的可靠性因子。
可选的，所述处理模块具体用于：
将至少K个操作结果相同的目标节点确定为诚实节点；
将操作结果与诚实节点的操作结果不相同的目标节点确定为作恶节点；
将无反馈结果的目标节点以及未选中的候选节点确定为中性节点。
可选的，根据下述公式(2)确定出所述各候选节点的更新变化量；
其中，Δσ
i(h)为第i个候选节点的更新变化量；
为目标节点的节点效率；C
1为诚实节点的调整值；t
i为目标节点处理操作请求得到操作结果的时长；T
1为诚实节点的类型；C
2为作恶节点的调整值；T
2为作恶节点的类型；T
3为中性节点的类型。
可选的，根据下述公式(3)更新所述各候选节点在第h次的可靠性因子；
其中，k为更新系数；σ
i(h)为第i个候选节点在第h次的可靠性因子；σ
i(h-1)为第i个候选节点在第h-1次的可靠性因子；Δσ
i(h)为第i个候选节点的更新变化量；D为初始预设值。
可选的，所述处理模块还用于：
若所述第i个候选节点在第h次的可靠性因子大于第一阈值，则将所述第 i个候选节点在第h次的可靠性因子设置为所述第一阈值；
若所述第i个候选节点在第h次的可靠性因子小于第二阈值，则将所述第i个候选节点在第h次的可靠性因子设置为所述第二阈值。
第三方面，本发明实施例还提供一种计算设备，包括：
存储器，用于存储程序指令；
处理器，用于调用所述存储器中存储的程序指令，按照获得的程序执行上述区块链中选择目标节点的方法。
第四方面，本发明实施例还提供一种计算机可读存储介质，所述计算机可读存储介质存储有计算机可执行指令，所述计算机可执行指令用于使计算机执行上述区块链中选择目标节点的方法。
为了更清楚地说明本发明实施例中的技术方案，下面将对实施例描述中所需要使用的附图作简要介绍，显而易见地，下面描述中的附图仅仅是本发明的一些实施例，对于本领域的普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他的附图。
图1为本发明实施例提供的一种系统架构示意图；
图2为本发明实施例提供的一种区块链中选择目标节点的方法的流程示意图；
图3为本发明实施例提供的一种区块链中选择目标节点的装置的结构示意图。
为了使本发明的目的、技术方案和优点更加清楚，下面将结合附图对本发明作进一步地详细描述，显然，所描述的实施例仅仅是本发明一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其它实施例，都属于本发明保护的范围。
在现有技术中，区块链上的节点交互之前，需在区块链上的节点中选择出目标节点，然后进行交互，其方法一般有以下两种方法：
1、根据区块链上的节点顺序进行选择。
2、随机选择一定数量的区块链上的节点。
但现有技术中的方案中存在的问题在于：区块链中的诚实节点和作恶节点被选择为目标节点的概率一致，在作恶节点被选为目标节点时，可能会存在共识过程过长，影响节点交互的效率。例如，无法区分作恶的情况下，按顺序或者随机的方式选择目标节点之后，可能出现经常向目标节点中的作恶节点发送查询信息，获得错误信息。或者向一个性能比较差的目标节点发送查询信息，需长时间才能收到节点回复。
因此，本发明实施例提供一种区块链中选择目标节点的方法，以区分区块链中的节点被选为目标节点的概率，提高区块链选择目标节点的智能性。 具体实施方式如下：
图1示例性的示出了本发明实施例所适用的一种系统架构，该系统架构包括客户端110、候选节点120、候选节点130和候选节点140。
其中，客户端110为区块链中的节点。需要说明的是，区块链中的节点不限于参与区块链网络共识进行账本维护的节点，还包括与区块链进行交互的客户端或SDK(Software Development Kit，软件开发工具包)。
候选节点不限于网络拓扑中与客户端110直接连接的节点，也可以为间接连接的节点。
客户端110用于获取候选节点120、候选节点130和候选节点140在第h-1次的可靠性因子，然后根据获取到的可靠性因子确定出候选节点120、候选节点130和候选节点140成为第h次的目标节点的概率区间。得到对应的概率区间之后，生成随机数，将与随机数对应的概率区间的候选节点确定为第h次的目标节点。例如，确定出候选节点130和候选节点140为目标节点，然后向目标节点(即候选节点130和候选节点140)发送操作请求，并确定目标节点基于操作请求的反馈结果，然后根据反馈结果更新候选节点120、候选节点130和候选节点140在第h次的可靠性因子。其中，第h次的可靠性因子用于选择第h+1次的目标节点。
候选节点120、候选节点130和候选节点140用于向客户端110提供自身的在第h-1次的可靠性因子，并在接收到客户端110发送的操作请求之后，发送反馈结果。
需要说明的是，上述图1所示的结构仅是一种示例，本发明实施例对此不做限定。
基于上述描述，图2示例性的示出了本发明实施例提供的一种区块链中选择目标节点的方法的流程，该流程可由区块链中选择目标节点的装置的执行。
如图2所示，该流程具体包括：
步骤201，获取区块链中各候选节点在第h-1次的可靠性因子。
本发明实施例中，各候选节点的第h-1次的可靠性因子是根据各候选节点在前h-1次的反馈结果确定的，且反馈结果与可靠性因子正相关。例如，再多次更新可靠性因子之后，反馈结果准确且效率高的候选节点的可靠性因子增大。
步骤202，根据所述各候选节点在第h-1次的可靠性因子，确定出第h次的L个目标节点。
本发明实施例中，根据得到的各候选节点在第h-1次的可靠性因子，确定各候选节点成为第h次的目标节点的概率区间，再根据各候选节点成为第h次的目标节点的概率区间确定第h次的目标节点。
具体的，根据各候选节点在第h-1次的可靠性因子，确定每个候选节点成为第h次的目标节点的概率区间。然后，生成随机数，将与随机数对应的概率区间的候选节点确定为第h次的目标节点。最后，重复生成随机数，直至确定出不重复的L个目标节点。
本发明实施例中，根据各候选节点在第h-1次的可靠性因子，确定出各候选节点的可靠性因子与候选节点的可靠性因子的总和的比值，该比值为各候选节点被选择为目标节点的概率，根据该比值确定每个候选节点成为第h次的目标节点的概率区间。
进一步地，根据下述公式(1)确定出概率区间：
其中，min为第i个候选节点成为第h次的目标节点的概率区间的最小值；
为第1个候选节点的可靠性因子与候选节点的可靠性因子的总和的比值至第i-1个候选节点的可靠性因子与各候选节点的可靠性因子的总和的比值总和；max为第i个候选节点成为第h次的目标节点的概率区间的最大值；ρ
i(h)为第i个候选节点的可靠性因子与各候选节点的可靠性因子的总和的比值；i为正整数。
为了更好的解释上述确定目标节点的技术方案，下面通过具体的实例进行阐述。
实例1
现区块链网络中存在四个候选节点A、B、C、D。其中，候选节点A在第h-1次的可靠性因子为24，候选节点B在第h-1次的可靠性因子为1，候选节点C在第h-1次的可靠性因子为24，候选节点D在第h-1次的可靠性因子为1。计算出候选节点A、B、C、D的可靠性因子的总和为50，则候选节点A被选择为目标节点的概率为24/50＝0.48，候选节点B被选择为目标节点的概率为24/50＝0.02，候选节点C被选择为目标节点的概率为24/50＝0.48，候选节点D被选择为目标节点的概率为24/50＝0.02，然后根据公式1可以得出候选节点A成为第h次的目标节点的概率区间为(0，0.48]，候选节点B成为第h次的目标节点的概率区间为(0.48，0.50]，候选节点C成为第h次的目标节点的概率区间为(0.50，0.98]，候选节点D成为第h次的目标节点的概率区间为(0.98，1]。
步骤203，向所述L个目标节点发送操作请求，并确定所述L个目标节点基于所述操作请求的反馈结果。
本发明实施例中，反馈结果包括目标节点基于操作请求处理后反馈的操作结果。其中，若L个目标节点中存在作恶节点，则作恶节点反馈的操作结果与其他目标节点反馈的操作结果不一致，以使操作结果一致的数量小于数量阈值，此时，将再次生成随机数，确定新增的目标节点。
进一步地，若L个目标节点的反馈结果中不存在满足共识要求的至少K(数量阈值)个相同的操作结果，则根据未选中的候选节点在第h-1次的可靠性因子，从未选中的候选节点中确定新增的目标节点。然后向新增的目标节点发送操作请求，并确定新增的目标节点基于操作请求的反馈结果，直至各目标节点中存在至少K个相同的操作结果。其中，K不大于L且均为正整数。需要说明的是，数量阈值K和L的数量是根据候选节点的数量确定的。例如， 根据PBFT共识算法，K-1需大于(候选节点的数量-1)/3。
本发明实施例中，因目标节点中可能存在多个作恶节点，导致反馈的操作结果一致的目标节点的数量不满足数量阈值K，则无法确定出目标节点中的诚实节点，因此需要再次生成随机数，从未选中的候选节点中确定新增的目标节点，直至各目标节点中存在至少K个相同的操作结果。例如，候选节点的数量为7，K＝3，现选择出3(L)个目标节点E、F和G，并确定出3(L)个目标节点反馈的操作结果为：目标节点F和G的操作结果一致，目标节点E的操作结果与目标节点F和G的操作结果不一致。因为操作结果一致的数量＝2小于K，因此，再次生成随机数，选择目标节点H，并确定出目标节点H的操作结果与目标节点F和G的操作结果一致，此时确定出目标节点的操作结果一致的数量＝3满足数量阈值K，则不再选择目标节点。
步骤204，若所述L个目标节点的反馈结果中存在满足共识要求的至少K个相同的操作结果，则根据所述L个目标节点的反馈结果更新所述各候选节点在第h次的可靠性因子。
本发明实施例中，在确定出目标节点的反馈结果中存在满足共识要求的至少K个相同的操作结果之后，根据相同的操作结果确定出各候选节点的节点类型，再根据各候选节点的节点类型更新各候选节点在第h次的可靠性因子。
进一步地，根据目标节点基于操作请求的操作结果，确定各候选节点的节点类型，根据目标节点处理操作请求得到操作结果的时长，确定目标节点的节点效率。需要说明的是，若目标节点处理操作请求得到操作结果的时长超过时间阈值，则降时长设置为时间阈值。其中，时间阈值可以为依据经验设置的值，例如可以取值0.5s等。
本发明实施例中，候选节点的节点类型包括诚实节点、作恶节点和中性节点，根据相同的操作结果确定出各候选节点的节点类型。
具体的，将至少K个操作结果相同的目标节点确定为诚实节点。
将操作结果与诚实节点的操作结果不相同的目标节点确定为作恶节点。
将无反馈结果的目标节点以及未选中的候选节点确定为中性节点。
在确定出各候选节点的节点类型之后，根据各候选节点的节点类型、目标节点的节点效率确定出各候选节点的更新变化量。然后根据各候选节点在第h-1次的可靠性因子和各候选节点的更新变化量更新各候选节点在第h次的可靠性因子。
进一步地，根据下述公式(2)确定出各候选节点的更新变化量：
其中，Δσ
i(h)为第i个候选节点的更新变化量，
为目标节点的节点效率，C
1为诚实节点的调整值，t
i为目标节点处理操作请求得到操作结果的时长，T
1 为诚实节点的类型，C
2为作恶节点的调整值，T
2为作恶节点的类型，T
3为中性节点的类型。其中，C
1和C
2是可以依据经验设置的值，例如可以取值12、5等。
在本发明实施例中，根据目标节点处理操作请求得到操作结果的时长确定诚实节点的节点性能，使性能高(即短时长)的诚实节点的更新变化量大于性能低(即长时长)的诚实节点的更新变化量，以区分开诚实节点的性能差异(即区分诚实节点处理操作请求的效率)。
根据下述公式(3)更新所述各候选节点在第h次的可靠性因子：
其中，k为更新系数，σ
i(h)为第i个候选节点在第h次的可靠性因子，σ
i(h-1)为第i个候选节点在第h-1次的可靠性因子，Δσ
i(h)为第i个候选节点的更新变化量，D为初始预设值。需要说明的是，k一般取值在0-1之间，D是可以依据经验设置的值，例如可以取值10。
本发明实施例中，在确定出各候选节点在第h次的可靠性因子之后，根据预设的上下限阈值，将各候选节点在第h次的可靠性因子的取值设置在上下限阈值。
具体的，若第i个候选节点在第h次的可靠性因子大于第一阈值(上限阈值)，则将第i个候选节点在第h次的可靠性因子设置为第一阈值。若第i个候选节点在第h次的可靠性因子小于第二阈值(下限阈值)，则将第i个候选节点在第h次的可靠性因子设置为第二阈值。其中，第一阈值和第二阈值可以依据经验设置的值，例如可以取值24、1等。需要说明的是，k的作用在于降低可靠性因子增大或减小的幅度，以防止可靠性因子过早的到达第一阈值和第二阈值。
本发明实施例，对于较早轮次(即h的值较小)的查询，每个候选节点会随机地被选为目标节点，经过多轮次(即h的值较大)的查询后，根据更新的可靠性因子，确定出候选节点中的高效的诚实节点，随着不断增加诚实节点的可靠性因子，则提高了高效的诚实节点的被选择为目标节点的概率，以此提升了选择目标节点的效率。同时，在选择目标节点的过程中通过概率区间选择目标节点，增加了随机性，保证选择范围；通过设置的更新系数以及第一阈值和第二阈值，避免了出现候选节点中局部最优的情况(即高效的诚实节点的可靠性因子过大)，防止了因网络抖动导致无法提供服务的高效的诚实节点，在恢复后没有被选择为目标节点的概率。可以通过候选节点对应的可靠性因子确定出候选节点中的作恶节点、宕机节点和性能差的节点，不再需人工标记作恶节点、宕机节点(无反馈结果的目标节点)和性能差的节点。自适应的减少客户端与作恶节点、宕机节点和性能差的节点进行交互的概率，提升节点交互的智能性和效率。
为了更好的解释上述技术方案，下面将在具体实例中进行阐述。
实例2
某区块链网络中有七个候选节点，分别记为候选节点1至候选节点7。根据PBFT共识算法确定出满足共识要求的K为3(即目标节点的反馈结果中存在满足共识要求的至少3个相同的操作结果)。在h＝1时，候选节点1至候选节点7的可靠性因子均为初始预设值D＝10，候选节点的可靠性因子的总和为70，则计算出候选节点1至候选节点7被选择为目标节点的概率均为1/7≈0.142857。根据公式(1)确定出第1个候选节点成为第1次的目标节点的概率区间为(0，0.142857]，第2个候选节点成为第1次的目标节点的概率区间为(0.142857，0.285714]，第3个候选节点成为第1次的目标节点的概率区间为(0.285714，0.428571]，第4个候选节点成为第1次的目标节点的概率区间为(0.428571，0.571429]，第5个候选节点成为第1次的目标节点的概率区间为(0.571429，0.714286]，第6个候选节点成为第1次的目标节点的概率区间为(0.714286，0.857143]，第7个候选节点成为第1次的目标节点的概率区间为(0.857143，1]。
生成一个(0，1]的随机数，如随机数为0.6，0.6∈(0.571429，0.714286]，则候选节点5为第一个目标节点，再次生成一个(0，1]的随机数，若该随机数仍属于(0.571429，0.714286]，则放弃选择，直至不重复的确定出3(L)个目标节点，如候选节点1、候选节点4和候选节点5被选择为目标节点。
向候选节点1、候选节点4和候选节点5发送操作请求之后，确定出候选节点1的操作结果为a，时长为0.1s，候选节点4的操作结果为b，时长0.1s，候选节点5无操作结果。由于操作结果相同的数量不满足K的值，因此，再次生成随机数，选择新增的目标节点为候选节点3，再向候选节点3发送操作请求，确定出候选节点3的操作结果为a，时长0.2s。此时操作结果相同的数量依然没有满足K的值，再选择出一个目标节点(如候选节点6)，并发送操作请求，确定出候选节点6的操作结果为a，耗时0.6s。此时操作结果相同的数量满足K的值，则表示操作结果a为正确反馈结果，结束选择目标节点，并统计各候选节点的情况如表1所示：
表1
| 候选节点序号 | 操作结果 | 是否正确 | 时长(时长阈值阈值为0.5s) |
| 1 | a | 是 | 0.1s |
| 3 | a | 是 | 0.2s |
| 4 | b | 否 | 0.1s |
| 5 | 无 | 无 | 无 |
| 6 | a | 是 | 0.6s |
由表1可以看出，候选节点1、候选节点3和候选节点4为诚实节点，候选节点4为作恶节点，候选节点5为无反馈结果的目标节点，候选节点2和候选节点7为中性节点。
现预设更新系数k为0.9，诚实节点的调整值C
1＝12，作恶节点的调整值C
2＝5，则根据公式(2)和公式(3)更新各候选节点在第1次的可靠性因子如下：
候选节点1在第1次的可靠性因子为：
候选节点2在第1次的可靠性因子为：
σ
2(1)＝0.9·σ
2(0)+Δσ
2(1)＝0.9*10+0＝9；
候选节点3在第1次的可靠性因子为：
候选节点4在第1次的可靠性因子为：
σ
4(1)＝0.9·σ
4(0)+Δσ
4(1)＝0.9*10-5＝4；
候选节点5在第1次的可靠性因子为：
σ
5(1)＝0.9·σ
5(0)+Δσ
5(1)＝0.9*10+0＝9；
由于候选节点6的时长超过了时长阈值，因此在计算候选节点6的可靠性因子时，将候选节点6的时长设置为时长阈值，所以候选节点6在第1次的可靠性因子为：
候选节点7在第1次的可靠性因子为：
σ
7(1)＝0.9·σ
7(0)+Δσ
7(1)＝0.9*10+0＝9；
至此，更新了各候选节点在第1次的可靠性因子。
基于相同的技术构思，图3示例性的示出了本发明实施例提供的一种区块链中选择目标节点的装置的结构，该装置可以执行区块链中选择目标节点的方法的流程。
如图3所示，该装置具体包括：
获取模块301，用于获取区块链中各候选节点在第h-1次的可靠性因子；其中，各候选节点的第h-1次的可靠性因子是根据各候选节点在前h-1次的反馈结果确定的；反馈结果与可靠性因子正相关；h为正整数；
处理模块302，用于根据所述各候选节点在第h-1次的可靠性因子，确定出第h次的L个目标节点；
向所述L个目标节点发送操作请求，并确定所述L个目标节点基于所述操作请求的反馈结果；
若所述L个目标节点的反馈结果中存在满足共识要求的至少K个相同的操作结果，则根据所述L个目标节点的反馈结果更新所述各候选节点在第h次的可靠性因子；K不大于L且均为正整数。
可选的，所述处理模块302具体用于：
根据所述各候选节点在第h-1次的可靠性因子，确定每个候选节点成为第h次的目标节点的概率区间；
生成随机数，将与所述随机数对应的概率区间的候选节点确定为第h次的目标节点；
重复生成随机数，直至确定出不重复的L个目标节点。
可选的，根据下述公式(1)确定出所述概率区间；
其中，min为第i个候选节点成为第h次的目标节点的概率区间的最小值；
为第1个候选节点的可靠性因子与各候选节点的可靠性因子的总和的比值至第i-1个候选节点的可靠性因子与各候选节点的可靠性因子的总和的比值总和；max为第i个候选节点成为第h次的目标节点的概率区间的最大值；ρ
i(h)为第i个候选节点的可靠性因子与各候选节点的可靠性因子的总和的比值；i为正整数。
可选的，所述处理模块302还用于：
若所述L个目标节点的反馈结果中不存在满足共识要求的至少K个相同的操作结果，则根据未选中的候选节点在第h-1次的可靠性因子，从所述未选中的候选节点中确定新增的目标节点；
向所述新增的目标节点发送所述操作请求，并确定所述新增的目标节点基于所述操作请求的反馈结果，直至各目标节点中存在至少K个相同的操作结果。
可选的，所述处理模块302具体用于：
根据目标节点基于所述操作请求的操作结果，确定各候选节点的节点类型；
根据目标节点处理所述操作请求得到所述操作结果的时长，确定目标节点的节点效率；
根据各候选节点的节点类型、目标节点的节点效率确定出所述各候选节点的更新变化量；
根据所述各候选节点在第h-1次的可靠性因子和所述各候选节点的更新变化量更新所述各候选节点在第h次的可靠性因子。
可选的，所述处理模块302具体用于：
将至少K个操作结果相同的目标节点确定为诚实节点；
将操作结果与诚实节点的操作结果不相同的目标节点确定为作恶节点；
将无反馈结果的目标节点以及未选中的候选节点确定为中性节点。
可选的，根据下述公式(2)确定出所述各候选节点的更新变化量；
其中，Δσ
i(h)为第i个候选节点的更新变化量；
为目标节点的节点效率；C
1为诚实节点的调整值；t
i为目标节点处理操作请求得到操作结果的时长；T
1为诚实节点的类型；C
2为作恶节点的调整值；T
2为作恶节点的类型；T
3为中性节点的类型。
可选的，根据下述公式(3)更新所述各候选节点在第h次的可靠性因子；
其中，k为更新系数；σ
i(h)为第i个候选节点在第h次的可靠性因子；σ
i(h-1)为第i个候选节点在第h-1次的可靠性因子；Δσ
i(h)为第i个候选节点的更新变化量；D为初始预设值。
可选的，所述处理模块302还用于：
若所述第i个候选节点在第h次的可靠性因子大于第一阈值，则将所述第i个候选节点在第h次的可靠性因子设置为所述第一阈值；
若所述第i个候选节点在第h次的可靠性因子小于第二阈值，则将所述第i个候选节点在第h次的可靠性因子设置为所述第二阈值。
基于相同的技术构思，本发明实施例还提供一种计算设备，包括：
存储器，用于存储程序指令；
处理器，用于调用所述存储器中存储的程序指令，按照获得的程序执行上述区块链中选择目标节点的方法。
基于相同的技术构思，本发明实施例还提供一种计算机可读存储介质，所述计算机可读存储介质存储有计算机可执行指令，所述计算机可执行指令用于使计算机执行上述区块链中选择目标节点的方法。
本领域内的技术人员应明白，本申请的实施例可提供为方法、系统、或计算机程序产品。因此，本申请可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本申请是参照根据本申请的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
显然，本领域的技术人员可以对本申请进行各种改动和变型而不脱离本申请的精神和范围。这样，倘若本申请的这些修改和变型属于本申请权利要 求及其等同技术的范围之内，则本申请也意图包含这些改动和变型在内。
Claims (10)
- 一种区块链中选择目标节点的方法，其特征在于，包括：获取区块链中各候选节点在第h-1次的可靠性因子；其中，各候选节点的第h-1次的可靠性因子是根据各候选节点在前h-1次的反馈结果确定的；反馈结果与可靠性因子正相关；h为正整数；根据所述各候选节点在第h-1次的可靠性因子，确定出第h次的L个目标节点；向所述L个目标节点发送操作请求，并确定所述L个目标节点基于所述操作请求的反馈结果；若所述L个目标节点的反馈结果中存在满足共识要求的至少K个相同的操作结果，则根据所述L个目标节点的反馈结果更新所述各候选节点在第h次的可靠性因子；K不大于L且均为正整数。
- 如权利要求1所述的方法，其特征在于，所述根据所述各候选节点在第h-1次的可靠性因子，确定出第h次的L个目标节点，包括：根据所述各候选节点在第h-1次的可靠性因子，确定每个候选节点成为第h次的目标节点的概率区间；生成随机数，将与所述随机数对应的概率区间的候选节点确定为第h次的目标节点；重复生成随机数，直至确定出不重复的L个目标节点。
- 如权利要求2所述的方法，其特征在于，根据下述公式(1)确定出所述概率区间；
其中，min为第i个候选节点成为第h次的目标节点的概率区间的最小值；为第1个候选节点的可靠性因子与各候选节点的可靠性因子的总和的比值至第i-1个候选节点的可靠性因子与各候选节点的可靠性因子的总和的比值总和；max为第i个候选节点成为第h次的目标节点的概率区间的最大值；ρ i(h)为第i个候选节点的可靠性因子与各候选节点的可靠性因子的总和的比值；i为正整数。
- 如权利要求1所述的方法，其特征在于，所述方法还包括：若所述L个目标节点的反馈结果中不存在满足共识要求的至少K个相同的操作结果，则根据未选中的候选节点在第h-1次的可靠性因子，从所述未选中的候选节点中确定新增的目标节点；向所述新增的目标节点发送所述操作请求，并确定所述新增的目标节点基于所述操作请求的反馈结果，直至各目标节点中存在至少K个相同的操作结果。
- 如权利要求1至4任一项所述的方法，其特征在于，所述确定所述L 个目标节点基于所述操作请求的反馈结果，包括：根据目标节点基于所述操作请求的操作结果，确定各候选节点的节点类型；根据目标节点处理所述操作请求得到所述操作结果的时长，确定目标节点的节点效率；所述根据所述L个目标节点的反馈结果更新所述各候选节点在第h次的可靠性因子，包括：根据各候选节点的节点类型、目标节点的节点效率确定出所述各候选节点的更新变化量；根据所述各候选节点在第h-1次的可靠性因子和所述各候选节点的更新变化量更新所述各候选节点在第h次的可靠性因子。
- 如权利要求5所述的方法，其特征在于，所述根据目标节点基于所述操作请求的反馈结果，确定各候选节点的节点类型，包括：将至少K个操作结果相同的目标节点确定为诚实节点；将操作结果与诚实节点的操作结果不相同的目标节点确定为作恶节点；将无反馈结果的目标节点以及未选中的候选节点确定为中性节点。
- 如权利要求5所述的方法，其特征在于，根据下述公式(2)确定出所述各候选节点的更新变化量；
其中，Δσ i(h)为第i个候选节点的更新变化量；为目标节点的节点效率；C 1为诚实节点的调整值；t i为目标节点处理操作请求得到操作结果的时长；T 1为诚实节点的类型；C 2为作恶节点的调整值；T 2为作恶节点的类型；T 3为中性节点的类型。
- 如权利要求7所述的方法，其特征在于，根据下述公式(3)更新所述各候选节点在第h次的可靠性因子；
其中，k为更新系数；σ i(h)为第i个候选节点在第h次的可靠性因子；σ i(h-1)为第i个候选节点在第h-1次的可靠性因子；Δσ i(h)为第i个候选节点的更新变化量；D为初始预设值。 - 如权利要求8所述的方法，其特征在于，所述方法还包括：若所述第i个候选节点在第h次的可靠性因子大于第一阈值，则将所述第i个候选节点在第h次的可靠性因子设置为所述第一阈值；若所述第i个候选节点在第h次的可靠性因子小于第二阈值，则将所述第i个候选节点在第h次的可靠性因子设置为所述第二阈值。
- 一种区块链中选择目标节点的装置，其特征在于，包括：获取模块，用于获取区块链中各候选节点在第h-1次的可靠性因子；其中，各候选节点的第h-1次的可靠性因子是根据各候选节点在前h-1次的反馈结果确定的；反馈结果与可靠性因子正相关；h为正整数；处理模块，用于根据所述各候选节点在第h-1次的可靠性因子，确定出第h次的L个目标节点；向所述L个目标节点发送操作请求，并确定所述L个目标节点基于所述操作请求的反馈结果；若所述L个目标节点的反馈结果中存在满足共识要求的至少K个相同的操作结果，则根据所述L个目标节点的反馈结果更新所述各候选节点在第h次的可靠性因子；K不大于L且均为正整数。
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011007613.X | 2020-09-23 | ||
| CN202011007613.XA CN112187765B (zh) | 2020-09-23 | 2020-09-23 | 一种区块链中选择目标节点的方法及装置 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2022063013A1 true WO2022063013A1 (zh) | 2022-03-31 |
Family
ID=73956273
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/CN2021/118684 WO2022063013A1 (zh) | 2020-09-23 | 2021-09-16 | 一种区块链中选择目标节点的方法及装置 |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN112187765B (zh) |
| WO (1) | WO2022063013A1 (zh) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112187765B (zh) * | 2020-09-23 | 2023-04-07 | 深圳前海微众银行股份有限公司 | 一种区块链中选择目标节点的方法及装置 |
| CN114389825B (zh) * | 2022-03-24 | 2022-07-08 | 腾讯科技（深圳）有限公司 | 一种基于区块链的数据通信方法和相关装置 |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108965329A (zh) * | 2018-08-23 | 2018-12-07 | 泰链（厦门）科技有限公司 | 区块链系统的共识机制实现方法、介质、装置及系统 |
| CN110677485A (zh) * | 2019-09-30 | 2020-01-10 | 大连理工大学 | 一种基于信用的动态分层拜占庭容错共识方法 |
| CN111106942A (zh) * | 2019-12-13 | 2020-05-05 | 南京邮电大学 | 一种基于ap-pbft算法的区块链信用机制 |
| CN111277627A (zh) * | 2020-01-08 | 2020-06-12 | 深圳讴谱科技有限公司 | 一种基于贡献量权重证明的共识机制 |
| CN111325577A (zh) * | 2020-02-17 | 2020-06-23 | 合肥工业大学 | 一种区块链中的广告块资源分配方法 |
| CN111523890A (zh) * | 2020-04-23 | 2020-08-11 | 腾讯科技（深圳）有限公司 | 基于区块链的数据处理方法、装置、存储介质及设备 |
| CN112187765A (zh) * | 2020-09-23 | 2021-01-05 | 深圳前海微众银行股份有限公司 | 一种区块链中选择目标节点的方法及装置 |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108259235B (zh) * | 2018-01-04 | 2019-11-22 | 杭州复杂美科技有限公司 | 一种区块链记账节点选择方法 |
| CN109889382B (zh) * | 2019-02-20 | 2020-07-21 | 中国互联网络信息中心 | 一种基于区块链混合共识的域名信息维护系统 |
| CN110049029B (zh) * | 2019-04-04 | 2021-07-20 | 矩阵元技术（深圳）有限公司 | 共识节点确定方法、装置、计算机设备和存储介质 |
| CN110784346B (zh) * | 2019-10-18 | 2022-07-29 | 深圳供电局有限公司 | 一种基于信誉值的pbft共识系统及方法 |
| CN111241114B (zh) * | 2020-01-07 | 2022-05-24 | 中国科学院信息工程研究所 | 一种结合交易与共识的智能服务交易区块链信誉管理方法和系统 |
-
2020
- 2020-09-23 CN CN202011007613.XA patent/CN112187765B/zh active Active
-
2021
- 2021-09-16 WO PCT/CN2021/118684 patent/WO2022063013A1/zh active Application Filing
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108965329A (zh) * | 2018-08-23 | 2018-12-07 | 泰链（厦门）科技有限公司 | 区块链系统的共识机制实现方法、介质、装置及系统 |
| CN110677485A (zh) * | 2019-09-30 | 2020-01-10 | 大连理工大学 | 一种基于信用的动态分层拜占庭容错共识方法 |
| CN111106942A (zh) * | 2019-12-13 | 2020-05-05 | 南京邮电大学 | 一种基于ap-pbft算法的区块链信用机制 |
| CN111277627A (zh) * | 2020-01-08 | 2020-06-12 | 深圳讴谱科技有限公司 | 一种基于贡献量权重证明的共识机制 |
| CN111325577A (zh) * | 2020-02-17 | 2020-06-23 | 合肥工业大学 | 一种区块链中的广告块资源分配方法 |
| CN111523890A (zh) * | 2020-04-23 | 2020-08-11 | 腾讯科技（深圳）有限公司 | 基于区块链的数据处理方法、装置、存储介质及设备 |
| CN112187765A (zh) * | 2020-09-23 | 2021-01-05 | 深圳前海微众银行股份有限公司 | 一种区块链中选择目标节点的方法及装置 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112187765A (zh) | 2021-01-05 |
| CN112187765B (zh) | 2023-04-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2022063013A1 (zh) | 一种区块链中选择目标节点的方法及装置 | |
| CN109324757B (zh) | 区块链数据缩容方法、装置及存储介质 | |
| US11082203B2 (en) | Method and apparatus for accelerating the blockchain for secure and high throughput applications | |
| US12079804B2 (en) | Transaction assignment method and apparatus based on structured directed acyclic graph | |
| US11507543B2 (en) | Permissionless blockchain consensus method with adjusting block weight, system and P2P network | |
| US20220067063A1 (en) | Apparatus and method for adaptively managing sharded blockchain network based on deep q network | |
| US9647927B2 (en) | Computer-implemented K-shortest path finding method | |
| US20240296343A1 (en) | Data fusion method and apparatus for distributed graph learning | |
| CN105677489A (zh) | 离散流处理模型下批次间隔大小的动态设置系统及方法 | |
| van Leeuwen et al. | CoCoA: A non-iterative approach to a local search (A) DCOP solver | |
| US10362105B1 (en) | Generating probalistic data structures in gossip protocols | |
| Khan et al. | A fast distributed approximation algorithm for minimum spanning trees | |
| US7933962B1 (en) | Reducing reliance on a central data store while maintaining idempotency in a multi-client, multi-server environment | |
| KR101570933B1 (ko) | 데이터분산서비스에서 동적 블룸 필터를 이용한 노드 탐색 시스템 및 방법 | |
| EP4020890B1 (en) | Method and system for balancing cross-domain broadcast network load of blockchain, computer device, and readable storage medium | |
| US9560027B1 (en) | User authentication | |
| WO2023184979A1 (zh) | 超密集网络的基站节能方法、节能装置和可读存储介质 | |
| CN111405037A (zh) | 区块同步方法、设备和存储介质 | |
| Hackfeld | A lightweight BFT consensus protocol for blockchains | |
| CN109388609B (zh) | 基于加速核的数据处理方法和装置 | |
| CN112929432B (zh) | 一种基于重复广播历史的广播方法、设备及储存介质 | |
| CN115002073A (zh) | 一种基于改进raft的数据更新方法及系统 | |
| CN114637472A (zh) | 基于dht的区块链存储扩展方法、电子设备及存储介质 | |
| CN109508433B (zh) | 基于匹配算法性能调整的负载波动应对方法和系统 | |
| CN108234173B (zh) | 节点副本更新方法和装置 |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| NENP | Non-entry into the national phase |
Ref country code: DE |
|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 21871384 Country of ref document: EP Kind code of ref document: A1 |
|
| 32PN | Ep: public notification in the ep bulletin as address of the adressee cannot be established |
Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205 DATED 04/07/2023) |
|
| 122 | Ep: pct application non-entry in european phase |
Ref document number: 21871384 Country of ref document: EP Kind code of ref document: A1 |