Autonomous Routing Path Selection via One-Way Latency Matrix
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Internet transit services are vulnerable to eavesdropping and fail to route around partially degraded networks, leading to suboptimal performance, and existing technologies do not adequately address issues of transmission speed, security, and reliability.
Innovation Solution
A method for autonomous selection of data routing paths in computer networks, which forms a pulse group of nodes, measures one-way latencies, and determines low-latency paths using a one-way latency matrix, allowing for secure and efficient routing independent of clock synchronization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional shortest path routing is used, then routing simplicity is maintained, but network performance degrades when paths are partially degraded
Solution Approach 1:
The patent implements dynamic routing by continuously measuring one-way latencies between nodes and adjusting routing paths in real-time based on current network conditions. The system transitions from static shortest-path routing to dynamic latency-based routing, allowing the network to adapt to degraded paths by selecting alternative routes when direct paths become suboptimal.
Solution Approach 2:
The patent introduces intermediary relay nodes that facilitate indirect routing paths. When direct paths between source and destination become degraded, the system routes traffic through one or more relay nodes that act as intermediaries, thereby maintaining connectivity and performance through alternative paths.
2Reliability
If direct routing paths are used, then transmission speed is maximized under normal conditions, but security vulnerability to eavesdropping increases
Solution Approach 1:
The patent introduces relay nodes as intermediaries that terminate encrypted connections. Data is encrypted from source to relay node and re-encrypted from relay node to destination, creating secure hops that prevent eavesdropping on end-to-end direct connections. The relay nodes act as trusted intermediaries that enable secure indirect routing.
Solution Approach 2:
The patent segments the end-to-end communication path into multiple independent hops through relay nodes. Each hop is independently encrypted and secured, breaking the continuous encryption channel that would exist in direct routing. This segmentation allows security to be applied at each segment rather than requiring secure direct end-to-end paths.
3Measurement precision
If multiple routing paths are monitored for performance, then path selection accuracy improves, but measurement and computation overhead increases
Solution Approach 1:
The patent measures one-way latency in only one direction (source to destination) rather than bidirectionally, and measures latencies only for paths that are potentially optimal based on partial information. This partial measurement approach provides sufficient precision for routing decisions while significantly reducing the computational energy required compared to comprehensive bidirectional measurements of all possible paths.
Data Source
AI summary
A method for autonomous selection of a data routing path in a computer network includes: forming a pulse group comprising a plurality of nodes in a computer network, automatically sending a plurality of pulse messages from a first node in the pulse group to other nodes in the pulse group, receiving one of the plurality of pulse messages by a second node in the pulse group, automatically computing a first one-way latency for a direct path from the first node to the second node based on a first time stamp and a second time stamp, automatically recording one-way latencies between each pair of nodes in the pulse group in a one-way latency matrix, and automatically determining a low-latency data routing path from the first node to the second node based on the one-way latencies in the one-way latency matrix.