Forwarding Adjacency Link Issuance in Virtual Clusters
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing method for advertising forwarding adjacency link states in virtual clusters is inefficient due to the establishment of IGP neighborhood relations between a large number of edge forwarding nodes and BGP RR nodes, leading to increased pressure on the controller and slowed advertising speed.
Innovation Solution
A method that does not require establishing an IGP neighborhood relation between edge forwarding nodes, where a first logical node receives node information from a controller, generates a logical link, adds it to an IGP protocol packet LSA/LSP, and advertises the link, thereby reducing system pressure and improving advertising speed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If IGP neighborhood relation is established between every two forwarding nodes and between edge FPs and each BGP RR node, then complete link state information can be advertised, but the pressure on the controller increases greatly
Solution Approach 1:
The patent extracts the IGP neighborhood relation establishment step from the link state advertising process. Instead of requiring actual IGP neighbor relationships between all edge forwarding nodes and BGP RR nodes, the system directly advertises link state information through LSA/LSP packets without establishing these relationships, thereby reducing controller pressure while maintaining information completeness
Solution Approach 2:
The patent segments the link state advertising function from the IGP neighborhood establishment function. The controller separately manages edge forwarding node information and advertises it through logical nodes using LSA/LSP packets, rather than requiring integrated IGP neighbor relationships, which reduces the complexity of maintaining comprehensive neighborhood relations
2Reliability
If IGP neighborhood relation is established between a large number of edge forwarding nodes and BGP RR nodes, then comprehensive routing information is available, but the advertising speed decreases due to required information interaction
Solution Approach 1:
The patent performs preliminary collection of edge forwarding node information by logical nodes from the controller before advertising. This allows the system to prepare link state data in advance and advertise it directly through LSA/LSP packets without waiting for time-consuming IGP neighborhood establishment and information exchange processes, thereby improving advertising speed while maintaining information completeness
Data Source
AI summary
An issuing method for a forwarding adjacency link and a logical node are provided. The method comprises: a first logical node receiving node information about a second edge forwarding node which is sent by a node management module of a controller in a virtual cluster; according to the node information about the second edge forwarding node, the first logical node generating a logical link between a first edge forwarding node and the second edge forwarding node; the first logical node adding the logical link between the first edge forwarding node and the second edge forwarding node to an IGP protocol message link state advertisement (LSA)/link state protocol data unit (LSP); and the first logical node issuing the logical link between the first edge forwarding node and the second edge forwarding node through the IGP protocol message LSA/LSP.