Adaptive Receive Side Scaling Key Selection for Network Load Balancing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for selecting a receive side scaling (RSS) key struggle to uniformly distribute incoming network packets across multiple processors in a multiprocessor device due to dynamic and unpredictable real-time network traffic, leading to suboptimal processor resource utilization and network traffic handling.
Innovation Solution
A real-time adaptive method that generates a set of candidate RSS keys, evaluates their performance using a packet distribution score, and dynamically selects the key with the highest score to ensure uniform packet distribution across multiple processors or processor cores, replacing underperforming keys with new ones as needed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a static RSS key is used to distribute network packets, then the distribution method is simple and stable, but the packet distribution becomes suboptimal under dynamic network traffic conditions
Solution Approach 1:
The patent implements dynamic RSS key selection by continuously monitoring packet distribution scores and switching from a static key to a dynamically selected key based on real-time network conditions. The system evaluates multiple candidate keys and selects the one with the highest distribution score, enabling the RSS mechanism to adapt to changing traffic patterns while maintaining manageable complexity through automated decision-making.
Solution Approach 2:
The patent introduces a feedback mechanism where the system monitors packet distribution scores over time and uses this information to determine when to switch RSS keys. The feedback loop compares current distribution performance against historical data and triggers key selection changes only when necessary, balancing adaptability with operational simplicity.
2Manufacturing precision
If multiple RSS keys are evaluated and selected dynamically, then packet distribution uniformity improves, but the processing time and computational overhead increase
Solution Approach 1:
The patent pre-generates and stores multiple candidate RSS keys before they are needed for packet distribution. This preliminary preparation allows the system to quickly switch between pre-computed keys without performing complex evaluations in real-time, thereby achieving high distribution uniformity while minimizing selection time during actual packet processing.
Solution Approach 2:
The patent replaces complex real-time mathematical optimization with a simpler lookup-based selection mechanism. Instead of computing optimal keys from scratch during packet processing, the system substitutes this mechanical computation with a search through pre-generated candidate keys, significantly reducing processing time while maintaining distribution uniformity.
3Productivity
If the system continuously monitors and switches RSS keys, then network traffic handling performance improves, but the system stability and predictability decrease
Solution Approach 1:
The patent uses feedback-based decision making to switch RSS keys only when distribution performance deteriorates. The system continuously monitors packet distribution scores and triggers key changes only when the current key becomes suboptimal, thereby improving traffic handling capacity while maintaining stability during normal operating conditions.
Solution Approach 2:
The patent changes the parameter being optimized from static key configuration to dynamic key selection based on distribution scores. By monitoring changes in distribution uniformity and only switching keys when necessary, the system adapts to improving traffic processing capacity while preserving compositional stability during periods of acceptable performance.
Data Source
AI summary
Selecting a receive side scaling (RSS) key is provided. It is determined whether a defined time interval expired. In response to determining that the defined time interval has expired, it is determined whether one or more keys in a set of randomly generated candidate RSS keys have a higher packet distribution score than an active RSS key. In response to determining that one or more keys in the set of randomly generated candidate RSS keys have a higher packet distribution score than the active RSS key, an RSS key having a highest packet distribution score is selected from the one or more keys in the set of randomly generated candidate RSS keys that have a higher packet distribution score than the active RSS key. The RSS key having the highest packet distribution score is used to distribute incoming network packets across a plurality of processors.


