Router Loop-Free Routing Table Module
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional routing tables in networking equipment can develop loops due to recursive routes, leading to incorrect forwarding behavior and route oscillations, which adversely affect notification and forwarding operations.
Innovation Solution
A module within the router's software is implemented to detect and eliminate routing loops by maintaining a temporary list of remote next hops and using timers to mark and manage hidden paths, ensuring a loop-free routing table through operations that evaluate and correct recursive routes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If clients add or delete routes with remote next hops to the routing table, then the routing table can contain more routes, but loops may be created causing incorrect forwarding behavior
Solution Approach 1:
The system performs preliminary loop detection by maintaining a temporary list of remote next hops and evaluating routes before they are added to the routing table. This prevents loops from being created in the first place, ensuring that only loop-free routes are installed while still allowing a large number of routes to be maintained.
Solution Approach 2:
A module acts as an intermediary between route clients and the routing table. This module intercepts route addition and deletion operations, performs loop detection using a temporary list of remote next hops, and only allows routes that pass the loop-free evaluation to be installed in the routing table.
2Reliability
If loop detection and elimination processes are implemented, then routing loops are prevented, but the complexity of the routing system increases
Solution Approach 1:
The loop detection mechanism uses the existing routing table structure and route evaluation processes to perform self-checks. The system leverages its own routing evaluation logic to detect loops, rather than requiring entirely separate detection infrastructure, thereby limiting the increase in complexity.
Solution Approach 2:
The loop detection functionality is nested within the existing route evaluation and installation process. The temporary list of remote next hops is integrated into the route addition workflow, and loop detection occurs as part of the normal route processing sequence, avoiding the need for separate complex detection systems.
3Measurement precision
If routes are evaluated and corrected for loops, then forwarding accuracy is improved, but the time required for route updates increases
Solution Approach 1:
Loop detection is performed preliminarily during the route evaluation phase, before routes are committed to the routing table. By using a temporary list of remote next hops to detect loops in advance, the system ensures forwarding accuracy without requiring time-consuming corrections after routes are installed.
Solution Approach 2:
The loop detection process uses efficient evaluation that skips detailed analysis for routes that are clearly loop-free. The temporary list mechanism allows the system to quickly identify potential loops without exhaustive checking of all routes, reducing the time overhead while maintaining forwarding accuracy.
Data Source
AI summary
A router is described that includes a routing table containing route information and a module to evaluate a route and detect a loop path associated with the route using the routing table. A process is described to detect and eliminate routing loops associated with recursive routes in a routing table, so as to provide a routing table that will be loop free.