Network Route Filtering for Limited Forwarding Memory
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Network switches require large memory capacity to store all Internet routes, which is expensive and inefficient.
Innovation Solution
Implement a system that analyzes network traffic statistics to identify the most-used routes and generates a filtered set of route updates, using a backend analyzer to determine a prefix list and a frontend filter to transmit only these updates to target routers or switches, ensuring the memory requirements are minimized.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If network switches store all Internet routes in the forwarding table, then complete route coverage is achieved, but memory cost increases significantly
Solution Approach 1:
The patent extracts only the most frequently used routes from the complete set of Internet routes and stores them in the forwarding table. The backend analyzer identifies hot prefixes based on traffic statistics, and the frontend filter transmits only these extracted routes to network devices, thereby reducing memory requirements while maintaining efficiency for the majority of traffic
Solution Approach 2:
Instead of storing all routes, the system implements partial action by storing only a subset of the most-used routes. The configuration allows administrators to specify the number of hot prefixes to install, creating a balance between memory usage and routing completeness. This partial approach suffices because most traffic follows a small fraction of popular routes
2Quantity of substance
If network switches store a reduced set of routes, then memory cost decreases, but routing completeness for less-used routes is compromised
Solution Approach 1:
The system performs preliminary action by analyzing traffic statistics in advance and pre-identifying the most frequently used prefixes before programming the forwarding table. The backend analyzer continuously monitors traffic patterns and maintains an updated list of hot prefixes, ensuring that the forwarding table is proactively configured with the most relevant routes before traffic demands arise
Solution Approach 2:
The system implements feedback mechanisms where the backend analyzer continuously monitors network traffic statistics and adjusts the list of hot prefixes accordingly. This feedback loop ensures that the forwarding table remains optimized based on actual traffic patterns, dynamically adapting to changing network usage while maintaining the reduced memory footprint
3Reliability
If all route updates are transmitted to network devices, then complete routing information is available, but network bandwidth and processing overhead increase
Solution Approach 1:
The frontend filter extracts only the necessary route updates corresponding to hot prefixes from the complete set of BGP route updates. By filtering out unnecessary updates for non-hot prefixes, the system significantly reduces the volume of routing information transmitted over the network, thereby lowering bandwidth consumption and processing overhead while maintaining completeness for frequently accessed routes
Data Source
AI summary
A system is disclosed for programming target devices with a filtered (reduced) set of route updates. The system can be divided into a backend system and a frontend system. The backend system analyzes all routes being used and generates a prefix list used for filtering. The frontend system can filter the route updates to target routers and switches to ensure that the number of prefixes installed in a forwarding table of the target routers or switches does not exceed a configured amount. Different frontend systems can coordinate to prevent deviations in the forwarding tables. More specifically, different frontend systems can synchronize with each other to ensure that a union of hot prefixes they propagate always remains under a configured prefix count. The backend system can be responsible for computing and maintaining a sorted list of prefixes, which can be at a per-site or per-service granularity.