知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

25 records (took 0.137 seconds)

    Hybrid data-routing method in a peer-to-peer computer network
    12.
    发明授权
    Hybrid data-routing method in a peer-to-peer computer network 有权

    公开(公告)号：US11863621B2

    公开(公告)日：2024-01-02

    申请号：US17815283

    申请日：2022-07-27

    Applicant: Syntropy Network Limited

    Inventor： Andrejus Mikonis ,  Vytautas Jurenas ,  Jonas Simanavicius

    IPC: H04L67/1087 ,  H04L45/121 ,  H04L47/283

    CPC classification number: H04L67/1093 ,  H04L45/121 ,  H04L47/283

    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.

    Hybrid method for node organization and data routing in a peer-to-peer computer network
    13.
    发明授权
    Hybrid method for node organization and data routing in a peer-to-peer computer network 有权

    公开(公告)号：US11863437B2

    公开(公告)日：2024-01-02

    申请号：US17809611

    申请日：2022-06-29

    Applicant: Syntropy Network Limited

    Inventor： Andrejus Mikonis ,  Vytautas Jurenas ,  Jonas Simanavicius

    IPC: H04L45/44 ,  H04L45/24 ,  H04L43/087 ,  H04L9/32 ,  H04L45/121

    CPC classification number: H04L45/44 ,  H04L9/3247 ,  H04L43/087 ,  H04L45/121 ,  H04L45/24

    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.

    System, method, utility, and governance for distributed data routing over the Internet
    15.
    发明申请
    System, method, utility, and governance for distributed data routing over the Internet 有权

    公开(公告)号：US20220345385A1

    公开(公告)日：2022-10-27

    申请号：US17321608

    申请日：2021-05-17

    Applicant: Syntropy Network Limited

    Inventor： Jonas Simanavicius ,  Domas Povilauskas ,  Vytautas Jurenas

    IPC: H04L12/26 ,  H04L12/24

    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.

    System and method for selecting data routing paths having reduced latencies in a distributed computer network
    16.
    发明申请
    System and method for selecting data routing paths having reduced latencies in a distributed computer network 有权

    公开(公告)号：US20220200907A1

    公开(公告)日：2022-06-23

    申请号：US17690250

    申请日：2022-03-09

    Applicant: Syntropy Network Limited

    Inventor： William B. Norton ,  Jonas Simanavicius

    IPC: H04L47/12 ,  H04L43/0894

    Abstract: A method for autonomously selecting data routing path by a distributed system includes forming a pulse group comprising a plurality of nodes in a computer network, automatically measuring one-way latencies between nodes in the pulse group, recording the one-way latencies in a one-way latency matrix, automatically determining a lower-latency data routing path from a first node to a second node through a relay node using in the one-way latency matrix. The lower-latency data routing path has a lower sum of one-way latencies from the first node to the second node via the relay node than the one-way latency for the direct path between from the first node to the second node. Data is sent from the first node to the second node via the relay node along the lower-latency data routing path. A payment transfer is automatically recorded in response to the data transmission along the lower-latency data routing path.

    Autonomous data routing in a peer-to-peer computer network
    17.
    发明授权
    Autonomous data routing in a peer-to-peer computer network 有权

    公开(公告)号：US11936553B2

    公开(公告)日：2024-03-19

    申请号：US18313326

    申请日：2023-05-06

    Applicant: Syntropy Network Limited

    Inventor： Andrejus Mikonis ,  Vytautas Jurenas ,  Jonas Simanavicius

    IPC: H04L45/121 ,  H04L43/0864

    CPC classification number: H04L45/121 ,  H04L43/0864

    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.

    System, method, utility, and governance for distributed data routing over the Internet
    19.
    发明公开
    System, method, utility, and governance for distributed data routing over the Internet 审中-公开

    公开(公告)号：US20230198887A1

    公开(公告)日：2023-06-22

    申请号：US18167713

    申请日：2023-02-10

    Applicant: Syntropy Network Limited

    Inventor： Jonas Simanavicius ,  Domas Povilauskas ,  Vytautas Jurenas

    IPC: H04L45/121 ,  H04L43/0852

    CPC classification number: H04L45/121 ,  H04L43/0858

    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.

    Autonomous data routing in a peer-to-peer computer network
    20.
    发明申请
    Autonomous data routing in a peer-to-peer computer network 有权

    公开(公告)号：US20230124157A1

    公开(公告)日：2023-04-20

    申请号：US17502382

    申请日：2021-10-15

    Applicant: Syntropy Network Limited

    Inventor： Andrejus Mikonis ,  Vytautas Jurenas ,  Jonas Simanavicius

    IPC: H04L12/721 ,  H04L29/08 ,  H04L12/26 ,  H04L12/743 ,  H04L9/32

    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.

Patent Agency Ranking