作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (17): 111-113,116. doi: 10.3969/j.issn.1000-3428.2010.17.038

• 网络与通信 • 上一篇    下一篇

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

笱程成,赵荣彩,单 征,田双鹏   

  1. (解放军信息工程大学信息工程学院,郑州 450002)

  • 出版日期:2010-09-05 发布日期:2010-09-02
  • 作者简介:笱程成(1985-),男,硕士,主研方向:网络安全; 赵荣彩,教授、博士;单 征,讲师、博士;田双鹏,硕士
  • 基金资助:
    counting bloom filter; load balancing; hash conflict; multiple-hash algorithm

Load Balancing Algorithm Based on Counting Bloom Filter

GOU Cheng-cheng, ZHAO Rong-cai, SHAN Zheng, TIAN Shuang-peng   

  1. (Institute of Information Engineering, PLA Information Engineering University, Zhengzhou 450002)
  • Online:2010-09-05 Published:2010-09-02

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

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

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

中图分类号: