Radix Tree Route-Map Clause Identification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Route redistribution in networks often leads to inefficiencies due to the sequential traversal of route-maps, particularly for routes corresponding to clauses later in the sequence or those matching multiple clauses, which complicates the determination of whether a route should be permitted or denied.
Innovation Solution
A routing computing system generates a radix tree based on prefix-list and route-map configurations, identifying the longest prefix match and associated highest priority route-map clause to efficiently permit or deny routes, thereby optimizing route redistribution.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If sequential traversal of route-map clauses is used, then route redistribution can be performed, but processing time increases for routes matching later clauses or multiple clauses
Solution Approach 1:
The patent segments the route-map clause sequence into a tree structure where each node represents a clause and branches represent prefix matches. This segmentation allows parallel evaluation of multiple clauses simultaneously rather than sequential traversal, reducing processing time while maintaining accurate route determination through the hierarchical match structure.
Solution Approach 2:
The patent performs preliminary organization of route-map clauses into a prefix tree structure before route matching occurs. By pre-processing and structuring the clauses hierarchically based on their prefixes, the system enables faster lookup and determination during actual route redistribution, avoiding repeated sequential traversal of the entire clause list.
2Adaptability or versatility
If sequential traversal of route-map clauses is used, then all clauses can be evaluated, but processing complexity increases for routes matching multiple clauses
Solution Approach 1:
The patent divides the route determination process into distinct segments: prefix extraction, tree traversal, and clause selection. Each segment handles a specific aspect of the matching process, making the overall complex task of evaluating multiple clauses more manageable and less computationally intensive while preserving flexible route matching capabilities.
Solution Approach 2:
The patent introduces a prefix tree as an intermediary data structure between the route-map clauses and the route matching process. This intermediary organizes clauses hierarchically by prefix, serving as a mediator that simplifies the matching process by providing a structured pathway to evaluate multiple clauses efficiently without direct sequential comparison.
Data Source
AI summary
Described herein are systems and methods to apply route-map configurations in a computing network. In one implementation, a routing computing system may identify a route for redistribution in a computing network and identify a longest prefix in a radix tree associated with the route. The routing computing system may further identify a highest priority route-map clause associated with the longest prefix match or any parent prefixes of the longest prefix match in the radix tree. Once identified, the computing system may perform an action associated with the highest priority route-map clause.