Decentralized Routing 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 network performance, with conventional technologies lacking in transmission speed, security, and reliability.
Innovation Solution
A decentralized system that forms pulse groups of nodes in a computer network, continuously measures one-way latencies, and dynamically determines better performing paths using a distributed full-mesh one-way latency matrix, allowing data to be routed through relay nodes for improved latency, security, and reliability, with payment validation using blockchain technologies.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If conventional routing technologies operate at the Network Layer selecting the shortest path, then the routing simplicity is maintained, but the network performance becomes suboptimal due to inability to route around degraded networks
Solution Approach 1:
The patent introduces a decentralized overlay network with relay nodes that act as intermediaries between source and destination nodes. These relay nodes measure and share latency information, enabling dynamic path selection around degraded network segments while maintaining routing simplicity through automated latency-based path determination.
Solution Approach 2:
The system dynamically adjusts routing paths based on real-time latency measurements between nodes. The decentralized network continuously monitors network conditions and automatically reroutes traffic around degraded segments, transforming static shortest-path routing into adaptive, performance-optimized routing.
2Object-affected harmful factors
If data is routed through relay nodes in a decentralized system, then the security against eavesdropping is improved through traffic dispersion, but the routing complexity increases
Solution Approach 1:
The decentralized relay network operates autonomously with nodes automatically measuring latencies, sharing measurements with peers, and selecting optimal paths without centralized control. This self-organizing behavior reduces routing complexity while maintaining security through automated path dispersion.
Solution Approach 2:
The system implements continuous latency measurement and sharing between relay nodes, creating a feedback loop that enables dynamic path optimization. Nodes use received latency information to automatically adjust routing decisions, reducing complexity through automated feedback-driven path selection.
3Measurement precision
If the system continuously measures and updates one-way latencies between all nodes, then the routing accuracy is improved, but the energy consumption increases
Solution Approach 1:
The latency measurement mechanism serves multiple functions: it provides routing path selection data, enables network performance monitoring, and supports dynamic path adjustment. This multi-functionality justifies the energy investment by extracting maximum value from the measurement infrastructure.
Solution Approach 2:
The system measures latencies between all pairs of relay nodes (full-mesh measurements), which exceeds the minimum needed for basic routing. This excessive measurement approach ensures complete visibility into network conditions, enabling optimal path selection even as network topology changes.
4Speed
If the decentralized system dynamically determines lower-latency paths using full-mesh latency matrices, then the transmission speed is improved, but the computational complexity increases
Solution Approach 1:
The system segments the routing decision process into distributed components at each relay node. Instead of one node computing all paths, each node independently processes its own latency measurements and received measurements from others, dividing computational complexity across the network while maintaining fast path determination.
Data Source
AI summary
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.