Probabilistic First-Hop Routing for Fault-Tolerant Grid Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
N-dimensional grid networks face issues with sparse link failures, node-to-node reachability, high load imbalance, and traffic congestion due to deterministic dimension-order routing techniques.
Innovation Solution
Implementing a randomly determined first hop for network routing based on a probability distribution, using a router that selects a path for a packet based on cumulative probabilities to improve fault tolerance without adding network complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If deterministic dimension-order routing techniques are used, then routing is simple and predictable, but fault tolerance is poor and load imbalance occurs
Solution Approach 1:
The patent applies dynamics by transitioning from static deterministic routing to dynamic probabilistic routing. The first hop selection is randomized based on probability distributions that can adapt to network conditions, allowing the system to dynamically respond to link failures and load imbalances while maintaining overall routing structure
Solution Approach 2:
The patent changes the routing parameter from fixed deterministic next-hop selection to probabilistic first-hop selection. By modifying the routing decision parameter to include probability distributions over potential first hops, the system achieves better fault tolerance without fundamentally changing the underlying network topology or routing algorithm complexity
2Productivity
If deterministic dimension-order routing is used, then network structure is simple, but load imbalance and traffic congestion occur
Solution Approach 1:
The patent introduces dynamic load balancing through probabilistic first-hop selection. Instead of fixed routing paths that cause congestion, the system dynamically selects from multiple potential first hops based on probability distributions, spreading traffic more evenly across the network and improving overall throughput
Solution Approach 2:
The patent segments the routing decision into two parts: randomized first-hop selection and deterministic subsequent hops. This segmentation allows the system to introduce flexibility only where needed (at the first hop) while maintaining simplicity in the rest of the routing path, thus improving throughput without excessive complexity
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Aspects of the disclosure are directed to a randomly determined first hop for network routing in an N-dimensional grid network. The first hop for a packet traversing the network is randomly determined based on a probability distribution for potential first hops. Based on a destination for the packet, a router in the network can search for potential paths and corresponding probabilities for the first hop, select a path based on the first hop, and forward the packet along that path to its destination. Network routing with a randomly determined first hop can improve fault tolerance without adding network complexities to the N-dimensional grid network.