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 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 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 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 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, 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.