Methods and systems implemented in a network architecture with nodes capable of performing message-based transactions
OwnerEnrico MAIMinventor
Life of this patent
Estimating the term…
Loading patent…
OwnerEnrico MAIMinventor
Estimating the term…
A method for establishing connection weights between network nodes is implemented by communicating data processing units, a public key and a private key being associated with each node, a given node being able to communicate its public key to another node, thus forming a so-called real connection (“IRL-connected”) between two nodes, and each node also being able to communicate to another node a public key received from yet another node, thus forming a so-called indirect connection between the other node and the yet another node. Each node can have a specific connection weight in relation to another node with which it has a real or indirect connection. In order to determine the connection weight of a second node in relation to a first node, the method comprises calculating a set combination of weighting factors (influence, proximity) of third nodes that are IRL-connected to the second node.
A method for establishing connection weights between network nodes, implemented by communicating data processing units, a public key and a private key being associated with each node, a given node being able to communicate its public key to another node, thus forming a so-called real connection (“IRL-connected”) between the two nodes, and each node also being able to communicate to another node a public key received from yet another node, thus forming a so-called indirect connection between the other node and the yet another node, a node being able to have a specific connection weight in relation to another node with which it has a real or indirect connection, the method comprising, in order to determine the connection weight of a second node in relation to a first node, calculating a set combination of weighting factors (influence, proximity) of third nodes that are IRL-connected to the second node.
A method for establishing so-called quasi-real connections between nodes of a network, implemented by communicating data processing units, a public key and a private key being associated with each node, a given node being able to communicate its public key to another node, thus forming a so-called real connection (“IRL-connected”) between the two nodes, and each node also being able to communicate to another node a public key received from yet another node, thus forming a so-called indirect connection between the other node and the yet another node, each node being able to have a specific connection weight in relation to another node with which it has a real or indirect connection, the method including the following steps:
22-47. (canceled)
49-53. (canceled)
Dependencies are inferred from the claim text.