MAC Address Table Collision Handling by Recursive Entry Migration
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Hash collisions in MAC address entries lead to inefficient storage in hash tables, resulting in the inability to store new entries due to occupied storage positions.
Innovation Solution
Implement a network apparatus with multiple hash tables, each bound to a unique hash algorithm, and employ a recursive traversal algorithm to migrate conflicting MAC address entries to free storage positions, using breadth-first or depth-first traversal methods to optimize storage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If hash calculation is used to store MAC address entries in hash tables, then storage efficiency is improved, but hash collisions cause storage positions to be occupied and prevent new entries from being stored
Solution Approach 1:
The patent divides the hash table into multiple storage blocks, where each storage block contains multiple hash tables and is bound to a unique hash algorithm. This segmentation allows the system to distribute MAC address entries across multiple storage blocks, reducing hash collisions in individual blocks while maintaining overall storage efficiency.
Solution Approach 2:
The patent changes the hash algorithm parameter by binding each storage block to a unique hash algorithm. When a hash collision occurs in one storage block, the system can try storing the entry in another storage block with a different hash algorithm, thereby resolving the collision and improving storage success rate.
2Reliability
If multiple hash tables with unique hash algorithms are used to resolve hash collisions, then storage success rate is improved, but device complexity increases
Solution Approach 1:
The patent organizes multiple hash tables into a hierarchical structure with storage blocks as containers. Each storage block contains multiple hash tables and is bound to a unique hash algorithm, creating a segmented structure that manages complexity through organized division while enabling collision resolution across blocks.
Solution Approach 2:
The patent creates a universal storage structure where storage blocks serve multiple functions: they contain hash tables, bind hash algorithms, and provide collision resolution mechanisms. This multi-functionality reduces overall system complexity by having storage blocks handle multiple responsibilities rather than requiring separate structures for each function.
Data Source
AI summary
A method for storing MAC address table entries includes: acquiring a learned MAC address table entry; computing a first storage position of the MAC address table entry in each storage block; determining that each first storage position stores a first conflict MAC address table entry; on the basis of a maximum recursion depth and a preset recursive traversal algorithm, performing traversal in all the storage blocks for a migratable storage position of each first conflict MAC address table entry; locating one or more migratable storage positions of one or more of the first conflict MAC address table entries in all the storage blocks; selecting one located migratable storage position, and performing table entry migration for the first conflict MAC address table entry corresponding to the selected migratable storage position; and storing the MAC address table entry into the first storage position of the migrated first conflict MAC address table entry.