Hybrid method for node organization and data routing in a peer-to-peer computer network

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

Full description

Saved in:
Bibliographic Details
Main Authors Jurenas, Vytautas, Mikonis, Andrejus, Simanavicius, Jonas
Format Patent
LanguageEnglish
Published 02.01.2024
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary: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.
Bibliography:Application Number: US202217809611