FIB Entry Optimizer Priority Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network communication systems face inefficiencies in managing and updating forwarding information bases (FIBs) due to full data plane FIBs, where new entries cannot be loaded, and computational costs are high due to the complexity of packet forwarding using routing information bases (RIBs).
Innovation Solution
A method and system where a FIB entry optimizer programs the data plane FIB by obtaining new entries, determining if the FIB is full, and either loading new entries or unloading lower-priority entries to make space, ensuring that higher-priority entries from the control plane FIB are loaded into the data plane FIB, thereby optimizing the data plane FIB's capacity and reducing computational costs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the data plane FIB is filled with entries to maximize forwarding capacity, then the packet forwarding rate is improved, but new entries cannot be loaded when the FIB is full
Solution Approach 1:
The patent implements dynamic entry management in the data plane FIB by continuously monitoring FIB utilization and automatically performing evictions when the FIB becomes full. The system dynamically adjusts the FIB contents based on current network requirements, allowing new high-priority entries to replace existing lower-priority entries, thus maintaining both high forwarding capacity and adaptability to new routing information.
Solution Approach 2:
The system changes the priority parameter of FIB entries to manage FIB fullness. When the data plane FIB is full, the controller receives priority information for new entries and evicts existing entries with lower priority values, allowing the FIB to maintain optimal capacity while accommodating new routing requirements through parameter-based selection.
2Reliability
If all control plane FIB entries are loaded into the data plane FIB, then forwarding accuracy is improved, but the data plane FIB becomes full and cannot accept new entries
Solution Approach 1:
The patent applies local quality by differentiating between high-priority and low-priority FIB entries. Instead of treating all entries equally, the system selectively loads high-priority entries into the data plane FIB while leaving low-priority entries in the control plane FIB. This selective approach ensures that the most critical forwarding decisions are made with high accuracy while maintaining space for additional entries.
Solution Approach 2:
The system extracts only the necessary high-priority entries from the control plane FIB and loads them into the data plane FIB. By taking out only the essential entries needed for accurate packet forwarding and leaving less critical entries in the control plane, the system achieves reliable forwarding without overwhelming the data plane FIB capacity.
3Productivity
If priority-based entry management is implemented, then optimal packet forwarding is achieved, but additional computational overhead is introduced
Solution Approach 1:
The system performs preliminary action by pre-calculating and assigning priority values to FIB entries before they are loaded into the data plane. The controller evaluates routing requirements in advance and tags entries with appropriate priority levels, so that when entries need to be evicted or selected, the decisions can be made quickly based on pre-established priority information rather than complex real-time analysis.
Solution Approach 2:
The priority-based management system serves itself by using the priority values embedded in the entries to automatically make selection and eviction decisions. Once entries are tagged with priority information, the FIB management mechanism can autonomously determine which entries to retain or evict based on these pre-assigned values, reducing the need for complex external control logic and minimizing computational overhead during operation.
Data Source
AI summary
In general, embodiments of the invention relate to a method of programming a data plane forwarding information base (FIB). The method includes obtaining, by a FIB entry optimizer in a control plane, a new entry to be loaded into the data plane FIB, making a first determination, by the FIB entry optimizer, that the data plane FIB is not full; and based on the first determination: loading, by the FIB entry optimizer, the new entry into the data plane FIB.