Abstract: A method is disclosed for autonomously routing data using in a peer-to-peer computer network includes automatically updating a peer-to-peer computer network. The method includes automatically sending pulse messages from a first node to neighbor nodes and candidate nodes, receiving return pulses by the first node from at least some of the neighbor nodes and the candidate nodes, calculating round-trip times (RTTs) between the first node and the neighbor nodes or the candidate nodes based on the pulse messages and the return pulses, sorting the nodes in the neighbor nodes and the candidate nodes into orbital bins based on RTTs, and automatically selecting and adding a node from one of the orbital bins based on the RTTs to updated neighbor nodes for the first node, and routing data from the first node to a second node via a relay node in the peer-to-peer computer network.

Abstract: A method for autonomous selection of a data routing path in a computer network includes: forming a pulse group comprising a plurality of nodes in a computer network, automatically sending a plurality of pulse messages from a first node in the pulse group to other nodes in the pulse group, receiving one of the plurality of pulse messages by a second node in the pulse group, automatically computing a first one-way latency for a direct path from the first node to the second node based on a first time stamp and a second time stamp, automatically recording one-way latencies between each pair of nodes in the pulse group in a one-way latency matrix, and automatically determining a low-latency data routing path from the first node to the second node based on the one-way latencies in the one-way latency matrix.

Abstract: A method is disclosed for autonomously routing data using relay nodes pre-selected from a group of distributed computer nodes based on measured one-way latencies. One-way latencies between a plurality of nodes in a pulse group are automatically measured. A sending bucket of nodes are automatically selected from the pulse group based on the one-way latencies. A receiving bucket of nodes are automatically selected from the pulse group based on the one-way latencies. In response to a command to transfer data from the first node to the second node, a relay node that is both in the first sending bucket and in the first receiving bucket is automatically selected, wherein data is automatically routed from the first node to the second node via the relay node.

Abstract: A method for autonomously routing data using in a peer-to-peer computer network is disclosed. The method includes identifying multiple paths from a source node to a destination node, wherein each of the multiple paths includes two or more routing segments each comprising a sending node and a receiving node. The receiving node is selected among a plurality of nodes in the peer-to-peer computer network based on round-trip times measured between the sending node and the plurality of nodes. Path packages are sent along the multiple paths from the source node to the destination node. Total one-way latencies (OWLs) associated with the multiple paths are measured using path packages from the source node to the destination node. A relayed data path is selected from the multiple paths at least in part based on the total OWLs respectively associated with the multiple paths from the source node to the destination node.

Abstract: A method for autonomously routing data using in a peer-to-peer computer network, includes automatically updating a peer-to-peer computer network comprising a plurality of nodes and automatically relaying data from the first node to a second node by one of the neighbor nodes associated with the first node. The method further includes automatically sending pulse messages from a first node to neighbor nodes and candidate nodes, dynamically adjusting time intervals between the pulse messages, receiving return pulses by the first node from some of the neighbor nodes and the candidate nodes, calculating round-trip times (RTTs) between the first node and the neighbor nodes or the candidate nodes, sorting the nodes in the neighbor nodes and the candidate nodes into a plurality of orbital bins, and automatically selecting and assigning a node from the orbital bins to update neighbor nodes associated with the first node.

Abstract: A method for autonomously routing data using in a peer-to-peer computer network includes automatically discovering neighbor nodes associated with a first node in a peer-to-peer computer network by automatically sending bursts of first pulse messages from a first node to neighbor nodes and candidate nodes associated with the first node, and automatically updating neighbor nodes connected to the first node in the peer-to-peer computer network by sending second pulse messages from the first node to neighbor nodes and candidate nodes associated with the first node. The second pulse messages are longer than the first pulse messages, and have longer intervals in between than intervals between the first pulse messages in one of the bursts.

Abstract: A method for autonomously selecting low-latency data routing paths across the Internet by a distributed system includes in response to a data transfer need between a first node in a first pulse group and a second node in a second pulse group, automatically forming a third pulse group comprising the first node, the second node, and at least one additional node from the first pulse group or the second pulse group, automatically measuring one-way latencies between nodes in the third pulse group, including a first one-way latency for a direct path from the first node to the second node, automatically determining a lower-latency data routing path from the first node to the second node through a relay node based on the one-way latencies in the third pulse group, and sending data from the first node to the second node along the lower-latency data routing path via the relay node.

Abstract: A method is disclosed for autonomously discovering and utilizing low-latency routing paths in a distributed data routing network. The method includes automatically measuring one-way latencies between a plurality of nodes, and automatically calculating relay health scores of potential relayed data routing paths in the distributed network. A relayed data routing path is automatically selected based on the one-way latencies and relay health scores of potential relayed data routing paths. A relay health score for a potential relayed data routing path is based on uptimes of the potential relay node, or bandwidths, jitters, data package losses, or amount of data routed through the routing segments in the potential relayed data routing path. The selected relayed routing path has a routing health score that meets a pre-determined criterion. The selected relayed data routing path has a total one-way latency smaller than a one-way latency associated with in a direct path.

Abstract: A method is disclosed for autonomously routing data using in a peer-to-peer computer network includes automatically updating a peer-to-peer computer network. The method includes automatically sending pulse messages from a first node to neighbor nodes and candidate nodes, receiving return pulses by the first node from at least some of the neighbor nodes and the candidate nodes, calculating round-trip times (RTTs) between the first node and the neighbor nodes or the candidate nodes based on the pulse messages and the return pulses, sorting the nodes in the neighbor nodes and the candidate nodes into orbital bins based on RTTs, and automatically selecting and adding a node from one of the orbital bins based on the RTTs to updated neighbor nodes for the first node, and routing data from the first node to a second node via a relay node in the peer-to-peer computer network.

Abstract: A method is disclosed for autonomously routing data using in a peer-to-peer computer network includes identifying a destination node to receive a data transfer, storing IDs of neighbor nodes sorted into orbital bins according to round-trip times (RTTs) between a source node and the neighbor nodes, sending one or more path packages from the source node to the destination node in a first direct data path from the source node to the destination node, sending path packages from the source node to the neighbor nodes, sending one or more path packages comprising updated hop information from a first hop node to the destination node, calculating total one-way latencies and performance metrics respectively for the path packages received by the destination node, and selecting a relayed data path for the data transfer from the source node to the destination node.

Abstract: A method is disclosed for autonomously routing data using in a peer-to-peer computer network includes automatically updating a peer-to-peer computer network. The method includes automatically sending pulse messages from a first node to neighbor nodes and candidate nodes, receiving return pulses by the first node from at least some of the neighbor nodes and the candidate nodes, calculating round-trip times (RTTs) between the first node and the neighbor nodes or the candidate nodes based on the pulse messages and the return pulses, sorting the nodes in the neighbor nodes and the candidate nodes into orbital bins based on RTTs, and automatically selecting and adding a node from one of the orbital bins based on the RTTs to updated neighbor nodes for the first node, and routing data from the first node to a second node via a relay node in the peer-to-peer computer network.

Abstract: A method is disclosed for distributed routing data with latencies using relay nodes. The method includes automatically measuring one-way latencies between a plurality of nodes comprising a first node, a second node, and a relay node, producing a first signal associated with a proof of uptime for the relay node, producing a second signal associated with a proof of bandwidth for the relay node, after the proof of uptime and the proof of bandwidth of the relay node are validated, automatically identifying a relayed data routing path from the first node to the second node via the relay node based on the one-way latencies between the plurality of nodes, in response to a command to transfer data from the first node to the second node, and transferring data from the first node to the second node along the relayed data routing path.

Abstract: A method for autonomously routing data using in a peer-to-peer computer network includes automatically discovering neighbor nodes associated with a first node in a peer-to-peer computer network by automatically sending bursts of first pulse messages from a first node to neighbor nodes and candidate nodes associated with the first node, and automatically updating neighbor nodes connected to the first node in the peer-to-peer computer network by sending second pulse messages from the first node to neighbor nodes and candidate nodes associated with the first node.

Abstract: A method is disclosed for autonomously routing data using in a peer-to-peer computer network includes automatically updating a peer-to-peer computer network. The method includes automatically sending pulse messages from a first node to neighbor nodes and candidate nodes, receiving return pulses by the first node from at least some of the neighbor nodes and the candidate nodes, calculating round-trip times (RTTs) between the first node and the neighbor nodes or the candidate nodes based on the pulse messages and the return pulses, sorting the nodes in the neighbor nodes and the candidate nodes into orbital bins based on RTTs, and automatically selecting and adding a node from one of the orbital bins based on the RTTs to updated neighbor nodes for the first node, and routing data from the first node to a second node via a relay node in the peer-to-peer computer network.

Abstract: A method for autonomously routing data using in a peer-to-peer computer network is disclosed. The method includes identifying multiple paths from a source node to a destination node, wherein each of the multiple paths includes two or more routing segments each comprising a sending node and a receiving node. The receiving node is selected among a plurality of nodes in the peer-to-peer computer network based on round-trip times measured between the sending node and the plurality of nodes. Path packages are sent along the multiple paths from the source node to the destination node. Total one-way latencies (OWLs) associated with the multiple paths are measured using path packages from the source node to the destination node. A relayed data path is selected from the multiple paths at least in part based on the total OWLs respectively associated with the multiple paths from the source node to the destination node.

Abstract: A method for autonomously routing data using in a peer-to-peer computer network, includes automatically updating a peer-to-peer computer network comprising a plurality of nodes and automatically relaying data from the first node to a second node by one of the neighbor nodes associated with the first node. The method further includes automatically sending pulse messages from a first node to neighbor nodes and candidate nodes, dynamically adjusting time intervals between the pulse messages, receiving return pulses by the first node from some of the neighbor nodes and the candidate nodes, calculating round-trip times (RTTs) between the first node and the neighbor nodes or the candidate nodes, sorting the nodes in the neighbor nodes and the candidate nodes into a plurality of orbital bins, and automatically selecting and assigning a node from the orbital bins to update neighbor nodes associated with the first node.

Abstract: A method is disclosed for autonomously routing data using in a peer-to-peer computer network includes identifying a destination node to receive a data transfer, storing IDs of neighbor nodes sorted into orbital bins according to round-trip times (RTTs) between a source node and the neighbor nodes, sending one or more path packages from the source node to the destination node in a first direct data path from the source node to the destination node, sending path packages from the source node to the neighbor nodes, sending one or more path packages comprising updated hop information from a first hop node to the destination node, calculating total one-way latencies and performance metrics respectively for the path packages received by the destination node, and selecting a relayed data path for the data transfer from the source node to the destination node.

Abstract: A method is disclosed for distributed routing data with latencies using relay nodes. The method includes automatically measuring one-way latencies between a plurality of nodes comprising a first node, a second node, and a relay node, producing a first signal associated with a proof of uptime for the relay node, producing a second signal associated with a proof of bandwidth for the relay node, after the proof of uptime and the proof of bandwidth of the relay node are validated, automatically identifying a relayed data routing path from the first node to the second node via the relay node based on the one-way latencies between the plurality of nodes, in response to a command to transfer data from the first node to the second node, and transferring data from the first node to the second node along the relayed data routing path.

Abstract: A method for autonomous data routing in a distributed network includes installing containerized applications at a plurality of nodes including a first node, a second node, and a relay node in a computer network, automatically measuring one-way latencies between the plurality of nodes responsive to instructions of the containerized applications, automatically selecting, responsive to the containerized applications, a relayed data routing path from the first node to the second node via the relay node at least in part based on the one-way latencies between nodes in the computer network, automatically transferring data from the first node to the second node along the relayed data routing path responsive to instructions of the containerized applications, and in response to the data transfer, automatically transferring a payment between digital wallets under the control of the containerized applications.

Abstract: A method is disclosed for autonomously discovering and utilizing low-latency routing paths in a distributed data routing network. The method includes automatically measuring one-way latencies between a plurality of nodes, and automatically calculating relay health scores of potential relayed data routing paths in the distributed network. A relayed data routing path is automatically selected based on the one-way latencies and relay health scores of potential relayed data routing paths. A relay health score for a potential relayed data routing path is based on uptimes of the potential relay node, or bandwidths, jitters, data package losses, or amount of data routed through the routing segments in the potential relayed data routing path. The selected relayed routing path has a routing health score that meets a pre-determined criterion. The selected relayed data routing path has a total one-way latency smaller than a one-way latency associated with in a direct path.