Randomized First-Hop Routing for Fault-Tolerant N-Dimensional Grids
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
N-dimensional grid networks face issues with node-to-node reachability due to sparse link failures, high load imbalance, and traffic congestion when using deterministic dimension-order routing techniques.
Innovation Solution
Implementing a randomly determined first hop for network routing based on a probability distribution, using a router to select a path for a packet based on potential first hops and their corresponding probabilities, stored in routing tables, 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 variations 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 structure
2Productivity
If deterministic routing is used, then routing overhead is low, but load imbalance and traffic congestion occur
Solution Approach 1:
The patent applies partial action by introducing randomness only in the first hop selection while maintaining deterministic behavior for subsequent hops. This partial randomization is sufficient to distribute load and avoid congestion without requiring complete randomization throughout the entire path, thus limiting the increase in routing overhead
Data Source
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.