When the hash lookup table is used to construct the filtering database defined by the VLAN-aware bridges in IEEE 802.1Qprotocol

the hash bucket is usually used to resolve the hash collisions caused by multiple keywords corresponding to the same storage address.The traditional hash bucket is low in efficiency as it acquires the resources of the entire learning table with only one hash address.This article presents an optimization method to improve collisions of the hash table

i.e.constructing the hash table by dual hash buckets and an overflow bucket and performs address learning in a balanced learning approach. When the dual bucket overflow occurs

it stores the overflow-entry in the overflow bucket temporarily and notifies the CPU to release the location of collision-entry and move the overflow-entry.The simulation results show that this new algorithm minimizes the hash collisions effectively

and improves the utilization rate of the storage space of the hash table.