Relativistic Routing Protocol Latency Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional routing protocols in mobile networks are static and inefficient in distributing traffic, often leading to increased costs due to the installation of additional capacity, as they do not effectively utilize alternate paths based on congestion and latency, resulting in suboptimal path selection.
Innovation Solution
The Relativistic Routing Protocol (RRP) dynamically routes packets based on lowest latency, utilizing all available alternate paths to distribute traffic efficiently, even if they are longer in distance or number of hops, thereby leveraging paths with less congestion.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional routing protocols use static parameters to determine the shortest path, then the routing decision is simple and fast, but the path selected is not necessarily the least congested nor has the lowest delay
Solution Approach 1:
The patent implements dynamic routing by continuously monitoring network conditions (congestion, latency) and adjusting path selection in real-time. The system transitions from static parameter-based routing to dynamic condition-based routing, where the optimal path is determined by current network state rather than predetermined metrics.
Solution Approach 2:
The patent employs feedback mechanisms by monitoring network performance metrics (congestion levels, latency) and using this information to adjust routing decisions. The system continuously gathers data about network conditions and feeds this information back into the routing algorithm to optimize path selection dynamically.
2Reliability
If conventional routing protocols install additional capacity to serve a heavily loaded path, then the heavily loaded path can handle more traffic, but the costs in mobility network bandwidth and equipment increase
Solution Approach 1:
The patent implements dynamic load balancing by continuously monitoring network conditions (congestion, latency) and adjusting path selection in real-time. The system transitions from static parameter-based routing to dynamic condition-based routing, where the optimal path is determined by current network state rather than predetermined metrics.
Solution Approach 2:
The patent changes the routing parameters from static metrics (hop count, distance) to dynamic metrics (congestion level, latency). By changing what parameters are used for routing decisions, the system can optimize traffic distribution without requiring additional infrastructure, simply by making smarter use of existing capacity.
3Reliability
If conventional routing protocols utilize link state routing to determine unusable links, then the routing protocol can avoid failed links, but it does not necessarily find another path that is the least congested nor has the lowest delay
Solution Approach 1:
The patent changes the routing parameters from static metrics (hop count, distance) to dynamic metrics (congestion level, latency). By changing what parameters are used for routing decisions, the system can optimize traffic distribution without requiring additional infrastructure, simply by making smarter use of existing capacity.
Solution Approach 2:
The patent employs feedback mechanisms by monitoring network performance metrics (congestion levels, latency) and using this information to adjust routing decisions. The system continuously gathers data about network conditions and feeds this information back into the routing algorithm to optimize path selection dynamically.
Data Source
AI summary
Aspects of the subject disclosure may include, for example: obtaining first information identifying a first path between a source node located in a network and a destination node located in the network, wherein the first path comprises a first plurality of nodes including at least one first intermediate node between the source node and the destination node, and wherein the first information comprises first latency information that identifies a first travel latency that exists on the first path between the source node and the destination node; obtaining second information identifying a second path between the source node and the destination node, wherein the second path comprises a second plurality of nodes including at least the source node and the destination node, and wherein the second information comprises second latency information that identifies a second travel latency that exists on the second path between the source node and the destination node; and selecting as a selected path either the first path or the second path, the selecting being based upon the first travel latency and the second travel latency, wherein the selecting is such that the selected path is capable of carrying a packet from the source node to the destination node in less time than the one of the first path or the second path that is not selected. Other embodiments are disclosed.


