Dynamic Exact Match Cache Compression for Network Switching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional virtual switches, such as Open vSwitch, face inefficiencies in memory usage and throughput due to fixed memory allocation for exact match caches, which can lead to suboptimal performance in handling network packets.
Innovation Solution
Implementing a system that dynamically configures and compresses the exact match flow cache based on the current flow rule set, reducing memory consumption and improving packet processing efficiency by only storing relevant header fields, thereby enhancing switching throughput and reducing cache occupancy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If fixed memory allocation is used for exact match cache entries, then cache coverage is improved, but memory usage efficiency deteriorates
Solution Approach 1:
The patent applies dynamics by making the cache entry size adjustable rather than fixed. The system dynamically determines the required cache entry size based on the actual flow rule requirements, allowing the memory allocation to adapt to different networking scenarios and eliminate wasted space while maintaining sufficient cache coverage.
Solution Approach 2:
The patent changes the parameter of cache entry size from a fixed value to a variable parameter that is determined by analyzing flow rules. By calculating the minimum required size based on actual flow requirements, the system optimizes memory usage while ensuring adequate cache coverage for all relevant flows.
2Device complexity
If fixed memory allocation is used for exact match cache, then cache structure simplicity is maintained, but throughput performance deteriorates
Solution Approach 1:
The system introduces dynamic size determination for cache entries based on flow rule analysis. This dynamic approach allows the cache to allocate only the necessary memory for each flow type, improving throughput by reducing memory access overhead while maintaining a relatively simple cache structure through automated size calculation.
3Measurement precision
If full header fields are stored in exact match cache, then packet processing accuracy is improved, but memory consumption increases
Solution Approach 1:
The patent extracts only the necessary fields from the full packet header based on flow rule requirements. By identifying and storing only the essential fields needed for flow classification and matching, the system reduces memory consumption while maintaining the accuracy required for correct packet processing decisions.
Solution Approach 2:
The system applies local quality by customizing the cache entry content according to specific flow requirements. Different flows may require different sets of header fields, so the system tailors the cache entry structure to match the actual needs of each flow type, optimizing both memory usage and processing accuracy.
Data Source
AI summary
Technologies for flow rule aware exact match cache compression include multiple computing devices in communication over a network. A computing device reads a network packet from a network port and extracts one or more key fields from the packet to generate a lookup key. The key fields are identified by a key field specification of an exact match flow cache. The computing device may dynamically configure the key field specification based on an active flow rule set. The computing device may compress the key field specification to match a union of non-wildcard fields of the active flow rule set. The computing device may expand the key field specification in response to insertion of a new flow rule. The computing device looks up the lookup key in the exact match flow cache and, if a match is found, applies the corresponding action. Other embodiments are described and claimed.