Hierarchical Forwarding Tree for Fast Network Rerouting
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional computer networks face significant challenges in rapidly updating routing information and rerouting packets following topology changes, such as link failures, which consumes considerable computing resources and delays packet transmission due to the complexity and size of routing information.
Innovation Solution
The implementation of a hierarchical tree organization in forwarding structures, where sub-trees are generated for sets of routes with common backup routes, allowing for fast rerouting by updating next hop entries in the parent tree to utilize a common backup route, thereby reducing the need for multiple next hop list updates.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional routers maintain routing information in routing tables for dynamic rerouting, then network reliability is improved, but device complexity and computing resource consumption increase
Solution Approach 1:
The patent segments routing information into hierarchical levels: a parent forwarding tree storing common backup routes for multiple routes, and child sub-trees storing fine-grain next hop entries for individual destinations. This segmentation allows routers to maintain comprehensive routing information for reliability while organizing it in a compact, manageable structure that reduces processing complexity.
Solution Approach 2:
The patent implements a nested hierarchical structure where child sub-trees are contained within parent forwarding trees. The parent tree contains references to child sub-trees, creating a nested organization where routing information is stored at multiple levels of abstraction, enabling efficient space utilization and simplified management.
2Adaptability or versatility
If routers update routing information after topology changes, then network adaptability is improved, but loss of time increases due to processing delay
Solution Approach 1:
The patent performs preliminary action by pre-computing and storing common backup routes in the parent forwarding tree before topology changes occur. When a link failure is detected, the router can immediately retrieve the pre-stored backup route information and initiate rerouting without waiting for complex re-computation, significantly reducing rerouting delay.
Solution Approach 2:
The patent implements dynamic adaptability through the hierarchical structure that allows flexible switching between parent-level backup routes and child-level specific routes. The system can dynamically navigate the hierarchy based on the topology change scope, adapting the rerouting behavior to match the actual failure conditions while maintaining fast response time.
3Measurement precision
If routers perform multiple next hop operations for different routes, then routing precision is improved, but computing resource consumption increases
Solution Approach 1:
The patent merges multiple next hop operations by consolidating common backup routes at the parent level and individual destination routes at the child level. Instead of processing separate next hop operations for each route independently, the hierarchical structure allows the router to process a single parent entry that references multiple child entries, reducing the total number of operations while maintaining precise next hop resolution for all destinations.
4Measurement precision
If routing tables store detailed routing information for all routes, then routing precision is improved, but device complexity increases
Solution Approach 1:
The patent segments the routing table into hierarchical components: parent forwarding trees that store summarized backup route information and child sub-trees that store detailed next hop entries. This segmentation maintains routing precision for individual destinations while reducing the complexity of managing the overall routing table through structured organization.
Solution Approach 2:
The parent forwarding tree entries serve multiple functions: they store backup route information, provide references to child sub-trees, and enable fast rerouting for multiple destinations simultaneously. This multi-functionality reduces the need for separate data structures, simplifying the overall routing table while maintaining detailed routing precision.
Data Source
AI summary
In one example, a method includes identifying a plurality of common direct routes to computing devices that are associated with a common indirect route to the computing devices. The method also includes generating a direct route structure that is associated with an entry of a forwarding structure using a next hop list, wherein the next hop list comprises: (1) a reference that identifies the direct route structure, the direct route structure comprising a plurality of direct next hops associated with the common direct routes to computing devices, (2) and an indirect next hop associated with an indirect next hop to the computing devices. The method also includes configuring the next hop list to use the direct route structure to route network data. The method also includes forwarding, by the computing device, network data according to the forwarding structure and the direct route structure.