Routing Information Update via Segmented Leaf Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In large networking environments, updating routing information in network devices such as routers is a time-consuming process due to the vast number of leaves, requiring significant processing and memory resources, as conventional methods involve recalculating and updating routes for all nodes and leaves, even if only a few have changed.
Innovation Solution
The implementation of specialized data structures like path-entry and dp-trie structures allows for efficient updates by identifying and updating only the nodes and leaves with associated changes, reducing the time complexity to be proportional to the number of affected leaves, independent of the total number of leaves, and facilitating node-centric updates.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional routing information updating methods are used, then all nodes and leaves are updated, but the process becomes time-consuming and resource-intensive
Solution Approach 1:
The patent segments the routing update process by dividing leaves into two categories: reachable leaves (accessible via current shortest path tree) and unreachable leaves (not accessible via current shortest path tree). This segmentation allows the system to update only the necessary portions of routing information when topology changes occur, rather than performing full recalculations for all leaves, thereby reducing update time while maintaining accuracy.
Solution Approach 2:
The patent applies partial action by performing routing updates only for affected leaves based on the type of topology change detected. For example, when a link cost changes, the system selectively updates routing information only for leaves that are impacted by this change, rather than recalculating routes to all leaves. This selective approach significantly reduces the time and computational resources required for routing updates.
2Reliability
If full SPF algorithm is executed for every topology change, then routing information is accurate, but processing resources are excessively consumed
Solution Approach 1:
The patent segments topology changes into different types (e.g., link cost changes, node additions, node deletions) and applies different update strategies for each type. This segmentation allows the system to avoid executing full SPF algorithms for all changes, instead using more efficient partial update methods for certain change types, thereby reducing processing resource consumption while maintaining routing accuracy.
Solution Approach 2:
The patent changes the parameter of update scope from global (all leaves) to local (affected leaves only) based on the specific topology change detected. By adjusting this parameter dynamically, the system can maintain routing information accuracy while significantly reducing the computational resources required for processing topology changes.
3Reliability
If routing information is updated for all leaves, then complete routing coverage is maintained, but the complexity of the update process increases
Solution Approach 1:
The patent simplifies the update process by segmenting leaves into reachable and unreachable categories, which provides a clear decision framework for determining what needs to be updated. This segmentation reduces the complexity of the update process by eliminating the need to evaluate all leaves uniformly, while still maintaining complete routing coverage for reachable leaves.
Solution Approach 2:
The patent applies partial action by updating routing information only for reachable leaves that are affected by topology changes, rather than performing exhaustive updates for all leaves. This approach maintains routing information completeness for necessary routes while significantly reducing the complexity of the update process.
Data Source
AI summary
Techniques for efficiently updating routing information in a network device such as a router. According to an embodiment of the present invention, information is stored identifying one or more nodes and leaves owned or advertised by the nodes. When a change occurs in a network environment, information is stored identifying one or more nodes and leaves that have changes associated with them. The routing information in the network device is then updated for only those nodes and leaves that have changes associated with them.