Switch Group Entry Priority Management for Table Overflow
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In OpenFlow network architecture, group and meter entries lack aging mechanisms, leading to table overflows, causing controllers to incur additional processing burdens and delays in managing errors.
Innovation Solution
A method where switches prioritize adding group and meter entries based on importance indication information, allowing them to delete lower-importance entries when necessary to make space for higher-importance ones, and notify controllers about table utilization thresholds to prevent overflows.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If group entries are added to the group table without an aging mechanism, then the group table can store more entries, but the group table will overflow when the maximum capacity is reached
Solution Approach 1:
The patent applies dynamics by making the group entry replacement mechanism adaptive and dynamic. When the group table is full, the system dynamically identifies and replaces the least recently used (LRU) or lowest priority group entry based on importance indication information. This dynamic replacement strategy allows the group table to continuously adapt to changing traffic patterns and priority requirements, preventing overflow while maintaining essential entries.
Solution Approach 2:
The patent changes the parameter of group entry management by introducing importance indication information (such as priority levels or weights) associated with each group entry. This parameter change enables the controller to make informed decisions about which entries to retain or replace, transforming the static group table management into a parameter-driven dynamic system that can prevent overflow by strategically managing entry lifecycles.
2Quantity of substance
If meter entries are added to the meter table without an aging mechanism, then the meter table can store more entries, but the meter table will overflow when the maximum capacity is reached
Solution Approach 1:
The patent applies dynamics to meter table management by implementing a similar adaptive replacement mechanism. When the meter table reaches capacity, the system dynamically identifies meter entries for replacement based on their usage patterns and associated importance information. This dynamic approach ensures that the meter table can accommodate new entries while maintaining reliability by preventing overflow through intelligent entry lifecycle management.
Solution Approach 2:
The patent introduces parameter changes by associating importance indication information with meter entries, enabling the controller to make parameter-driven decisions about entry retention and replacement. This transforms static meter table management into a dynamic system where entries are managed based on their operational parameters and priority levels, preventing overflow while maintaining essential metering functionality.
3Reliability
If the controller performs delete and add operations to manage group and meter entries, then table overflow can be prevented, but the processing burden of the controller increases
Solution Approach 1:
The patent applies self-service by enabling the switch to autonomously manage group and meter entry lifecycles. The switch monitors its own table capacities and automatically performs entry replacement operations based on importance indication information and usage patterns. This self-service capability eliminates the need for the controller to continuously monitor and manage entry lifecycles, preventing overflow while significantly reducing the controller's processing burden.
Solution Approach 2:
The patent implements feedback mechanisms where the switch monitors its own table utilization and automatically triggers entry replacement operations when thresholds are reached. This feedback-driven autonomous management allows the system to prevent overflow without requiring continuous controller intervention, improving productivity by reducing the controller's processing load while maintaining reliable table management.
4Device complexity
If the controller waits for error messages to detect table full conditions, then the system operates with simple architecture, but the response time to handle overflow situations is delayed
Solution Approach 1:
The patent applies preliminary action by implementing proactive entry replacement mechanisms that act before overflow occurs. The switch continuously monitors table capacities and automatically replaces entries based on importance and usage patterns, preventing overflow conditions before they happen. This preliminary action eliminates the need for reactive error message handling, reducing response time while maintaining simple system architecture.
Solution Approach 2:
The patent implements feedback mechanisms where the switch autonomously monitors its own table states and triggers replacement operations based on predefined thresholds and importance criteria. This self-monitoring feedback system enables timely overflow prevention without requiring complex controller monitoring logic, achieving fast response times while keeping the overall system architecture simple and decentralized.
Data Source
AI summary
An entry adding method includes: a switch receives a first group entry sent by a controller, where the first group entry includes importance indication information of the first group entry, and a first action bucket; the switch determines that the first group entry cannot be added to a group table, and that a second group entry exits in the group table, the switch deletes the second group entry and adds the first group entry to the group table. Where importance of the second group entry is lower than importance of the first group entry; the second group entry includes a second action bucket; a quantity of first action buckets is not greater than the sum of a first value and a quantity of second action buckets; and the first value is a quantity of available action buckets in the group table.


