基于计数布隆过滤器的负载均衡算法  

Load Balancing Algorithm Based on Counting Bloom Filter

作　　者：笱程成[1] 赵荣彩[1] 单征[1] 田双鹏[1] 

机构地区：[1]解放军信息工程大学信息工程学院,郑州450002

出　　处：《计算机工程》2010年第17期111-113,116,共4页Computer Engineering

基　　金：河南省杰出人才创新基金资助项目(0521000200)

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

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

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]