BGP Peer Grouping for Routing Convergence
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In BGP networks, the convergence time for distributing routing information among a large number of peers is slow, leading to degraded user experience due to latency, packet loss, and unreachable destinations, especially when there are over 200 peers and 100,000 routes, and existing mechanisms like static and dynamic peer-groups have limitations such as requiring same outbound routing policies and frequent recalculations.
Innovation Solution
A method where a BGP network device dynamically calculates and forms groups of peers, generating update messages individually for each peer based on its outbound routing policy, allowing flexible group membership and reducing the need for operator intervention, with update messages sent in specified intervals to optimize processor use and reduce network traffic.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If BGP peers exchange complete routing information with each other, then routing information is accurately distributed, but convergence time increases significantly when there are large numbers of peers and routes
Solution Approach 1:
The patent segments the routing information distribution process by dividing BGP peers into multiple groups and distributing routes to groups rather than to individual peers. This segmentation allows the routing information to be distributed in smaller, more manageable batches, reducing the time required for convergence while maintaining accuracy.
Solution Approach 2:
The patent applies partial action by selectively distributing only the necessary routing information to each group rather than distributing complete routing tables to all peers. This partial distribution approach reduces the volume of data exchanged during convergence, thereby reducing convergence time while still ensuring that each peer receives the routes it needs.
2Productivity
If static peer-groups are used to reduce convergence time, then update messages are sent more efficiently, but all peers in the same peer-group must have the same outbound routing policies
Solution Approach 1:
The patent segments peers into groups based on their routing policies, allowing different groups to have different routing policies. This segmentation enables efficient update message distribution to each group while maintaining the flexibility to accommodate diverse routing policies across different groups.
Solution Approach 2:
The patent applies local quality by allowing each group to have its own specific routing policies tailored to the needs of peers in that group. This means that routing policies are not uniformly applied across all peers but are customized for each group, providing both efficiency and flexibility.
3Adaptability or versatility
If dynamic update peer-groups are used to avoid static configuration, then routing policies can be applied dynamically, but the system must recalculate update-group membership upon every change to outbound routing policies
Solution Approach 1:
The patent applies preliminary action by pre-configuring peer groups with specific routing policies before routing changes occur. When routing changes happen, the system only needs to update the active group assignments rather than recalculating everything from scratch, reducing the complexity of dynamic reconfiguration.
Solution Approach 2:
The patent uses copying by creating reusable group configurations that can be assigned to different sets of peers. Instead of creating new group configurations from scratch when routing policies change, the system copies existing group templates and assigns them to appropriate peers, significantly reducing computational complexity.
4Reliability
If BGP devices send update messages to all peers individually, then each peer receives complete routing information, but network traffic increases and processor use becomes inefficient
Solution Approach 1:
The patent merges multiple individual update messages into single group-level update messages. Instead of sending separate update messages to each peer, the system sends one update message to a group that contains multiple peers, reducing the total volume of network traffic while ensuring that all peers in the group receive the necessary routing information.
Solution Approach 2:
The patent applies universality by creating group-level update messages that serve multiple peers simultaneously. A single update message to a group performs the function of multiple individual update messages, reducing network traffic while maintaining complete routing information delivery to all affected peers.
Data Source
AI summary
Described are a Border Gateway Protocol (BGP) network device and method for distributing routing information to a plurality of BGP peers over a network. The BGP network device dynamically calculates a number of groups and a number of BGP peers in each group based on routing information to be distributed. A time interval is specified within which to generate an update message for each BGP peer in a select one of the groups. An update message is generated for each BGP peer in the select group during the time interval. Routes included in the update message for each BGP peer are based on an outbound routing policy for that BGP peer. The update messages are forwarded for transmission to the BGP peers in the select group after the time interval expires.