Adaptive Route Summarization for IBGP Blackhole Avoidance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional IBGP route aggregation faces challenges such as administrative overhead, traffic blackholing, sub-optimal routing paths, and bandwidth wastage, while TRIES optimization techniques struggle with memory consumption and CPU usage.
Innovation Solution
Implementing autonomous adaptive route-summarization through a processing system that automatically determines and updates subnet and network identifiers, summarizing or deleting them as needed, using radix-trie structures and adaptive summarization algorithms to optimize memory and reduce bandwidth usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If conventional IBGP route aggregation is used, then routing paths are simplified, but traffic blackholing occurs and recovery is impossible
Solution Approach 1:
The patent segments the route aggregation process into multiple levels (Level 1, Level 2, Level 3 aggregations) with different granularities. This allows selective aggregation where traffic can be recovered at specific levels without affecting the entire routing path, resolving the blackholing issue while maintaining simplified routing where beneficial.
Solution Approach 2:
The patent implements dynamic route summarization where aggregation levels and parameters can be adjusted in real-time based on network conditions. This dynamic adaptation enables the system to recover from traffic blackholes by modifying aggregation parameters without requiring complete routing path reconfiguration.
2Ease of operation
If route summarization is performed manually, then administrative control is maintained, but administrative overhead increases
Solution Approach 1:
The patent implements autonomous route summarization where the system automatically determines aggregation parameters, selects optimal summarization levels, and performs route aggregation without manual intervention. This self-service mechanism eliminates administrative overhead while maintaining operational effectiveness through automated decision-making algorithms.
Solution Approach 2:
The patent incorporates feedback mechanisms where the system continuously monitors routing metrics and adjusts summarization parameters accordingly. This feedback loop enables the system to learn from network conditions and optimize summarization automatically, reducing administrative overhead while maintaining control through data-driven decisions.
3Quantity of substance
If conventional TRIES optimization is used, then memory consumption is reduced, but CPU usage increases
Solution Approach 1:
The patent applies different compression techniques to different parts of the routing table based on local characteristics. Instead of uniform optimization, it identifies specific regions or levels where certain compression methods are most effective, reducing overall memory consumption while minimizing CPU overhead by applying optimizations only where beneficial.
Solution Approach 2:
The patent dynamically adjusts optimization parameters such as aggregation granularity, compression levels, and trie node configurations based on real-time monitoring of memory and CPU usage. This parameter adaptation allows the system to achieve memory efficiency without excessive CPU consumption by tuning optimization intensity according to actual system state.
4Loss of substance
If route aggregation is applied, then bandwidth usage is reduced, but sub-optimal routing paths are created
Solution Approach 1:
The patent applies partial route aggregation where only specific routes are aggregated while others remain individual. This selective approach reduces bandwidth consumption for aggregated traffic without creating sub-optimal paths for critical or time-sensitive traffic, maintaining routing efficiency for essential communications while achieving bandwidth savings where applicable.
Data Source
AI summary
Aspects of the subject disclosure may include, for example, an apparatus, comprising: a processing system including a processor; and a memory that stores executable instructions that, when executed by the processing system, facilitate performance of operations, the operations comprising: automatically determining for a plurality of downstream network nodes one or more subnet identifiers, one or more network identifiers, or a combination thereof; automatically summarizing the one or more subnet identifiers, the one or more network identifiers, or the combination thereof to produce a summary; automatically determining whether the summary requires updating, resulting in a determination; and responsive to the determination being that the summary requires updating, automatically updating the summary to produce an updated summary, wherein the updated summary: deletes one or more subnets that were in the summary; adds one or more subnets that were not in the summary; deletes one or more networks that were in the summary, adds one or more networks that were not in the summary; deletes one or more non-existent identifiers, other than the one or more subnet identifiers and the one or more network identifiers, that were in the summary; adds one or more non-existent identifiers, other than the one or more subnet identifiers and the one or more network identifiers, that were not in the summary; or any combination thereof. Other embodiments are disclosed.