Abstract: The performance of hash-based load balancing algorithm for network flow cannot be bounded under the worst-case because of hash conflicts. To make up for the shortage of the above algorithm, a multiple-hash algorithm based on counting bloom filter, which stores the digest of flow needed to be adjusted in the Exact Stream Bloom Filter(ESBF) structure, is designed. Compared with the basic hash table, the integrity of the conversation is maintained and the query performance is improved due to the lower probability of conflict.

Key words: counting bloom filter, load balancing, hash conflict, multiple-hash algorithm

摘要： 由于哈希冲突的存在，基于哈希表的网络流负载均衡算法无法约束最坏情况下算法的性能。针对该问题，设计一种多哈希算法，将需要调整的流保存在精确流匹配布隆过滤器结构中。与基本哈希表相比，该算法保持了会话的完整性以及更低的冲突概率，提高了查询性能。

关键词: 计数布隆过滤器, 负载均衡, 哈希冲突, 多哈希算法

CLC Number: 

• TP301.6