BGP Route Entry Generation via Next Hop Count Comparison
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Configuring route preference policies for multiple BGP peers is cumbersome and complex, leading to a heavy workload in generating route entries.
Innovation Solution
A method where a first BGP speaker receives route messages from a second BGP speaker via different distribution paths, constructs and sends route messages with next hop attributes, and determines the route entry based on the number of next hops and path costs, eliminating the need for individual configuration of route preference policies for each peer.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If route preference policies are configured for multiple BGP peers respectively, then route selection can be controlled, but the configuration workload increases and implementation becomes complex
Solution Approach 1:
The patent merges the route preference control mechanism into a single global configuration (bgp always-compare-med) that applies to all BGP peers simultaneously. Instead of configuring separate policies for each peer, the system combines all route comparisons under a unified MED-based selection process, eliminating the need for multiple individual peer configurations while maintaining reliable route selection.
Solution Approach 2:
The patent creates a universal route selection mechanism that functions across all BGP peers in the system. The MED attribute comparison is applied universally to routes from any peer, making the route preference control applicable to multiple different scenarios and peer types without requiring separate configuration for each case.
2Adaptability or versatility
If multiple peer priorities and local-preference values are configured respectively, then route preference can be differentiated, but the configuration workload becomes heavy
Solution Approach 1:
The patent changes the routing parameter from peer-specific attributes (peer priority, local-preference) to a route-specific attribute (MED) that can be universally applied. By modifying the comparison criterion to use MED values carried in route messages, the system achieves route preference differentiation without requiring multiple configuration parameters for each peer, thereby improving configuration efficiency.
Solution Approach 2:
The patent extracts the route preference control logic from the peer configuration context and places it at the route message processing level. Instead of embedding preference values in peer configurations, the system extracts and uses MED attributes directly from incoming route messages, simplifying the configuration by removing the need for separate peer priority and local-preference settings.
Data Source
Figure 1
Figure 2~3
AI summary
Embodiments of the present invention provide a method for generating a route entry, including: receiving, by a first BGP speaker, a first route message and a second route message that are distributed respectively by a second BGP speaker by using a first distribution path and a second distribution path; determining, by the first BGP speaker, that a quantity of next hops in a first next hop list attribute is less than a quantity of next hops in a second next hop list attribute; and generating, by the first BGP speaker, a route entry according to path attributes, of a path towards a destination, in the first route message. In addition, the embodiments of the present invention further provide a first BGP speaker. The foregoing technical solution helps reduce a workload in configuring route preference policies.