US 11,863,423 B2
Hybrid data routing with burst pulse measurements in a peer-to-peer computer network
Andrejus Mikonis, Vilnius (LT); Vytautas Jurenas, Vilnius (LT); and Jonas Simanavicius, Vilnius (LT)
Assigned to Syntropy Network Limited, Palo Alto, CA (US)
Filed by Syntropy Network Limited, Palo Alto, CA (US)
Filed on Aug. 11, 2022, as Appl. No. 17/819,043.
Application 17/819,043 is a continuation in part of application No. 17/815,283, filed on Jul. 27, 2022.
Application 17/815,283 is a continuation in part of application No. 17/809,611, filed on Jun. 29, 2022.
Application 17/809,611 is a continuation in part of application No. 17/665,550, filed on Feb. 6, 2022, granted, now 11,743,179.
Application 17/665,550 is a continuation in part of application No. 17/502,382, filed on Oct. 15, 2021, granted, now 11,689,456.
Prior Publication US 2023/0124421 A1, Apr. 20, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. H04L 45/121 (2022.01); H04L 43/0829 (2022.01); H04L 43/0852 (2022.01); H04L 45/02 (2022.01)
CPC H04L 45/121 (2013.01) [H04L 43/0829 (2013.01); H04L 43/0852 (2013.01); H04L 45/02 (2013.01)] 21 Claims
OG exemplary drawing
 
1. A method for autonomously routing data in a peer-to-peer computer network, comprising:
automatically discovering a neighbor node associated with a first node in the peer-to-peer computer network, comprising:
automatically sending bursts of first pulse messages from the first node to neighbor nodes and candidate nodes associated with the first node;
in response to the bursts of first pulse messages, receiving first return pulses by the first node from at least some of the neighbor nodes and the candidate nodes;
calculating round-trip times (RTTs), jitter, and packet loss between the first node and the neighbor nodes or the candidate nodes based on the bursts of first pulse messages and the first return pulses;
sorting the neighbor nodes and the candidate nodes into a plurality of orbital bins each characterized by a specific interval of the RTTs associated with the first node; and
based on the RTTs, the jitter, and the packet loss, automatically selecting and assigning a node from one of the orbital bins to be the neighbor node associated with the first node;
automatically updating the neighbor nodes connected to the first node in the peer-to-peer computer network, comprising:
automatically sending second pulse messages from the first node to the neighbor nodes and the candidate nodes associated with the first node, wherein the second pulse messages are longer than the first pulse messages, wherein the second pulse messages have longer intervals in between than intervals between the first pulse messages in one of the bursts;
in response to the second pulse messages, receiving second return pulses by the first node from at least some of the neighbor nodes and the candidate nodes;
calculating RTTs between the first node and the neighbor nodes or the candidate nodes based on the second pulse messages and the second return pulses;
based on the RTTs and the jitter, automatically adding a candidate node to the plurality of orbital bins associated with the first node or retiring a neighbor node associated with the first node; and
based on the RTTs and the jitter, automatically selecting and assigning a node from one of the orbital bins to update the neighbor nodes associated with the first node; and
automatically relaying data from the first node to a second node by one of the neighbor nodes associated with the first node in the peer-to-peer computer network.