Multiplicity-Based Alternate Routing in Data Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current alternative routing techniques in data networks face challenges such as high computational complexity and inability to determine loop-free alternate routes, especially when the LFA inequality is not satisfied, leading to potential packet loss due to unavailability of primary routes.
Innovation Solution
The implementation of multiplicity-based alternative routing, where nodes determine and use multiplicity values to select the next hop for routing data packets, avoiding the need for extensive configuration of primary and alternate routes and relying on LFA routing, thus reducing complexity and ensuring route availability even when LFA inequality is not satisfied.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional LFA routing is used to determine alternate routes, then loop-free alternative routing can be achieved, but the routing fails when the LFA inequality is not satisfied
Solution Approach 1:
The patent changes the routing parameter from strict LFA inequality satisfaction to multiplicity-based selection. Instead of requiring dist(N,D) < dist(N,S) + dist(S,D), the invention uses multiplicity values (number of times a node has been visited) to select next-hop nodes, allowing alternate routing to work in topologies where LFA inequality cannot be satisfied.
2Reliability
If extensive configuration of primary and alternate routes is performed, then backup routes can be established, but the device complexity and computational overhead increase significantly
Solution Approach 1:
The patent implements self-service by having nodes automatically compute their own multiplicity values based on received data packets and dynamically select next-hop nodes without requiring manual configuration of backup routes. The system serves itself by using the traffic patterns and visit counts to inherently identify good alternate paths.
Solution Approach 2:
The patent performs preliminary action by pre-computing multiplicity values for all neighbor nodes before actual routing decisions are needed. When a primary route fails, the alternate route is already identified through previous multiplicity computations, enabling fast rerouting without complex real-time calculations.
3Adaptability or versatility
If multiplicity-based routing is used to select next hop nodes, then routing can be achieved in scenarios where LFA routing fails, but additional computational steps are required to determine multiplicity values
Solution Approach 1:
The patent substitutes the mechanical LFA inequality check with a computational multiplicity-based selection mechanism. Instead of performing geometric distance calculations and inequality checks, the system uses simple counter increments and comparisons of multiplicity values, which are computationally lighter and easier to implement in network routers.
Data Source
AI summary
Methods and apparatus to determine an alternate route in a network are disclosed. An example method disclosed herein to route a data packet to a destination in a network comprises determining multiplicity values for a set of neighbor nodes, a multiplicity value representing a number of times the data packet has been routed to a respective neighbor node in the set of neighbor nodes, and selecting, based on the multiplicity values, a first neighbor node from the set of neighbor nodes to which to send the data packet to route the data packet to the destination.