US 11,863,621 B2
Hybrid data-routing method 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 Jul. 27, 2022, as Appl. No. 17/815,283.
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/0121240 A1, Apr. 20, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. H04L 67/1087 (2022.01); H04L 45/121 (2022.01); H04L 47/283 (2022.01)
CPC H04L 67/1093 (2013.01) [H04L 45/121 (2013.01); H04L 47/283 (2013.01)] 21 Claims
OG exemplary drawing
 
1. A method for autonomously routing data in a peer-to-peer computer network, comprising:
automatically updating the peer-to-peer computer network comprising a plurality of nodes, comprising:
automatically sending pulse messages from a first node to neighbor nodes and candidate nodes associated with the first node;
dynamically adjusting time intervals between the pulse messages;
in response to the pulse messages, 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 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, 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 the data from the first node to a second node by one of the neighbor nodes associated with the first node.