Flow control for probabilistic relay in a blockchain network

Patent metadata

Field	Value
Publication number	US-12007984-B2
Application number	US-202318113592-A
Country	US
Kind code	B2
Filing date	Feb 23, 2023
Priority date	Jun 30, 2017
Publication date	Jun 11, 2024
Grant date	Jun 11, 2024

Abstract

Techniques are presented for removing a connection to a peer node determined to be malicious based on transactions received from the peer node.

First claim

What is claimed is:

1. A computer implemented method for a node of a blockchain network, said node having a plurality of interfaces connected to peer nodes, the method comprising:
analyzing transactions received from a peer node;
determining, based on the transactions received from the peer node, that the peer node is a malicious node;
determining a minimum and maximum number of peer nodes connectable to the node and a ratio of averaged data to maximum data, where averaged data comprises an average of data over at least two time periods of a plurality of time periods, a time period adjusted by the node to a predetermined value temporarily to accommodate a temporary relay of data to all peer nodes; and
upon determining the malicious node, removing connection to the peer node.

2. The method of claim 1 , wherein determining that the peer node is the malicious node is based on repeated transmission of a legitimate transaction action multiple times.

3. The method of claim 1 , wherein determining that the peer node is the malicious node is based on receiving invalid transactions from the peer node.

4. The method of claim 1 , wherein determining that the peer node is the malicious node is based on receiving dummy transactions from the peer node.

5. The method of claim 1 , further comprising, as a result of determining that the peer node is not malicious:
assigning a profile of the node based at least on input data and output data over a plurality of time periods; and
setting a minimum number of peer nodes and a maximum number of peer nodes connectable to the node based at least in part on the profile.

6. The method of claim 5 , wherein determining, by the node, the ratio is further based at least in part on the data transmitted, over at least one time period of the plurality of time periods, through the plurality of interfaces and the maximum amount of data processable by the node.

7. The method of claim 6 , wherein the profile is assigned a value according to a function of the node, wherein a profile factor includes at least:
a first value for nodes that route data;
a second value for nodes that collect or aggregate data; and
a third value for nodes that generate or provide data.

8. The method of claim 1 , wherein the node is connected to peer nodes by a plurality of interfaces and a correlation matrix is determined from correlation coefficients representing correlation between data processed at each interface of the node.

9. The method of claim 8 , further comprising determining a time period of a plurality of time periods based at least in part on a length of time between a change to the correlation matrix.

10. The method of claim 9 , further comprising:
receiving information related to activity of nodes on the blockchain network; and
determining the time period according to the length of time between the change to the correlation matrix.

11. The method of claim 1 , wherein the time period is adjusted by the node to the predetermined value temporarily to accommodate at least one of:
a local parameter update to the node; and
an initiation period, wherein the node accumulates data.

12. The method of claim 1 , wherein a time period is a flow control parameter, and the flow control parameter is adjusted to modify traffic passing through the node.

13. The method of claim 1 , wherein the node is of a blockchain network to perform the method.

14. A non-transitory computer-readable storage medium storing computer-executable instructions that, when executed, cause a processor to:
determine a capacity of a node over a time period based at least on input data and output data passing through one or more interfaces of the node to and from peer nodes;
assign a profile of the node based at least on the input data and output data over a plurality of time periods;
determine a ratio of averaged data to maximum data, where averaged data comprises an average of data over at least two time periods of a plurality of time periods, a time period adjusted by the node to a predetermined value temporarily to accommodate a temporary relay of data to all peer nodes; and
set a minimum number of peer nodes and a maximum number of peer nodes connectable to the node based at least in part on the profile and the ratio.

15. A system comprising:
an interface device;
a processor coupled to the interface device; and
a memory coupled to the processor, the memory having stored thereon computer-executable instructions that, when executed, cause the processor to:
determine a capacity of a node over a time period based at least on input data and output data passing through one or more interfaces of the node to and from peer nodes;
assign a profile of the node based at least on the input data and output data over a plurality of time periods;
determine a ratio of averaged data to maximum data, where averaged data comprises an average of data over at least two time periods of a plurality of time periods, a time period adjusted by the node to a predetermined value temporarily to accommodate a temporary relay of data to all peer nodes; and
set a minimum number of peer nodes and a maximum number of peer nodes connectable to the node based at least in part on the profile and the ratio.

16. The system of claim 15 , wherein the instructions further cause the processor to determine a corresponding correlation for each of the one or more interfaces of the node based at least in part on input data and output data processed at the node.

17. The system of claim 16 , wherein the instructions further cause the processor to:
relay received data based at least in part on a correlation of the receiving interface being at or below an average correlation of two or more interfaces of the node.

18. The system of claim 15 , wherein a time period corresponds to a length of time between a change to one or more correlations for each of the one or more interfaces of the node.

Assignees

• Nchain Licensing Ag

Inventors

• Destefanis Giuseppe
• Madeo Simone
• Motylinski Patrick
• Vincent Stephane
• Covaci Alexandra

Classifications

• H04L9/50

  using hash chains, e.g. blockchains or hash trees · CPC title

• H04L67/104

  Peer-to-peer [P2P] networks · CPC title

• H04L9/3093

  involving Lattices or polynomial equations, e.g. NTRU scheme · CPC title

• H04L9/0643

  Hash functions, e.g. MD5, SHA, HMAC or f9 MAC · CPC title

• H04L67/10

  in which an application is distributed across nodes in the network (software deployment G06F8/60; multiprogramming arrangements G06F9/46) · CPC title