BGP Update Groups for Faster Convergence
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Border Gateway Protocol (BGP) convergence methods are inefficient due to high resource overhead and inflexibility in managing update messages across peers, requiring manual configuration and independent message generation for each peer group, which slows convergence time and reduces processing efficiency.
Innovation Solution
The method involves establishing dynamic update groups based on matching outbound policies, allowing peers with similar policies to share update messages and automatically managing membership changes, thereby separating update message generation from peer-group configuration and reducing CPU and memory utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If update messages are sent independently to each peer group, then routing policy accuracy is maintained, but system processing overhead increases and convergence time slows
Solution Approach 1:
The patent segments peers into update groups based on matching outbound policies, allowing independent update message generation for each group while maintaining policy accuracy. This segmentation enables parallel processing of updates across multiple groups, improving convergence speed without sacrificing routing policy precision.
Solution Approach 2:
The patent changes the parameter of update message distribution from individual-peer-based to group-based, where peers with identical outbound policies are grouped together. This parameter change allows a single update message to be replicated to multiple peers simultaneously, reducing processing overhead and accelerating convergence while maintaining policy accuracy through group-based matching.
2Adaptability or versatility
If smaller peer-groups are configured to maintain policy flexibility, then routing policy adaptability is improved, but update message processing efficiency decreases
Solution Approach 1:
The patent introduces dynamic update groups that automatically form and dissolve based on peer outbound policy changes. This dynamic approach allows peers to be grouped with others having identical policies, maximizing group size for efficiency while maintaining the flexibility to reconfigure groups when policies change, thus resolving the contradiction between policy adaptability and processing efficiency.
Solution Approach 2:
The system automatically manages update group formation and peer assignment based on outbound policy matching, eliminating manual configuration requirements. This self-service mechanism dynamically adapts to policy changes and automatically optimizes group compositions, providing both policy flexibility and processing efficiency without manual intervention.
3Manufacturing precision
If manual peer group configuration is required, then routing policy control is precise, but system complexity and configuration overhead increase
Solution Approach 1:
The patent implements self-service automation where the system automatically forms update groups based on peer outbound policy matching and dynamically adjusts group compositions when policies change. This eliminates manual configuration complexity while maintaining precise policy control through automated policy-based grouping, resolving the contradiction between control precision and configuration complexity.
Solution Approach 2:
The patent changes the control mechanism from manual configuration to automated policy-based grouping. By using outbound policy matching as the grouping parameter, the system automatically achieves precise policy control without requiring manual configuration, thus reducing system complexity while maintaining control precision.
Data Source
AI summary
A method and apparatus for establishing update groups of peers having matching outbound policies are disclosed. When a change in the outbound policy of a peer is identified, the update group membership of the peer is resolved.