Cloud Route Reflector Root Address Assignment
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In BGP route reflection deployments, route reflectors not in an optimal forwarding path struggle to advertise best paths effectively, leading to suboptimal routing decisions and increased resource utilization due to the need for frequent SPF computations and memory-intensive IGP database storage.
Innovation Solution
A cloud-based route reflector automates the selection of optimal SPF roots and assigns root addresses to route reflector clients, using delta databases to track route metric differences and enable fast failover, reducing the need for frequent SPF computations and optimizing resource usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If route reflectors not in optimal forwarding path are used, then routing coverage is improved, but routing efficiency deteriorates due to suboptimal path selection
Solution Approach 1:
The patent pre-calculates and stores optimal path information in IGP databases before routing decisions are needed. By performing SPF computations in advance and caching the results, the system prepares optimal routing paths beforehand, allowing route reflectors to advertise accurate best paths without performing real-time computations, thus resolving the contradiction between coverage and efficiency
Solution Approach 2:
The patent introduces an intermediary mechanism where IGP databases act as mediators between route reflectors and BGP routing decisions. The IGP database stores pre-computed optimal path metrics that route reflectors query to determine best paths, eliminating the need for route reflectors to perform complex SPF computations themselves, thereby maintaining routing efficiency while enabling flexible deployment
2Measurement precision
If frequent SPF computations are performed, then routing accuracy is improved, but resource consumption increases
Solution Approach 1:
The system performs SPF computations in advance and stores results in IGP databases. When routing decisions are needed, the pre-computed optimal path metrics are retrieved from cache rather than recalculating, maintaining routing accuracy while dramatically reducing computational resource consumption during operation
Solution Approach 2:
Instead of performing continuous or frequent SPF computations, the system uses periodic updates triggered only by topology changes. The IGP database is updated periodically or event-driven, allowing the system to maintain accurate routing information while minimizing the frequency of computationally intensive operations, thus reducing resource consumption
3Quantity of substance
If IGP database storage is increased, then routing information completeness is improved, but memory usage increases
Solution Approach 1:
The patent extracts only the essential optimal path metrics from complete IGP databases and stores them in BGP routing tables. By taking out only the necessary routing information (best path metrics) rather than storing complete topology databases in every router, the system achieves routing information completeness where needed while minimizing memory usage at route reflectors
Solution Approach 2:
The system creates simplified copies of routing information by storing pre-computed optimal path metrics in IGP databases and caching essential routing data in BGP tables. These copies contain only the necessary routing decisions rather than complete network topology, reducing memory requirements while maintaining routing information completeness for making optimal routing decisions
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Embodiments are provided for providing optimal route reflector (ORR) root address assignment to route reflector clients and fast failover capabilities in an autonomous system, including identifying a first node in an autonomous system as a candidate root node of a first routing group, identifying a client node based on a neighbor address used in a first routing protocol, mapping the neighbor address to routing information received from the client node via a second routing protocol, and associating the neighbor address with the first routing group if the routing information includes an identifier of the first routing group. In more specific embodiments, identifying the first node as a candidate root node includes determining the first node and the first routing group are advertised in a first protocol packet, and determining the first node and the second routing group are advertised in a second protocol packet.