Bloom filter在防火墙中的应用和研究被引量：2

下载PDF

导出

摘要防火墙中传统的基于软件的内容过滤方式性能低，灵活性差，扩展能力不强。基于此提出基于bloom filter理论的硬件并行内容过滤方法，能够使防火墙快速进行数据包内容过滤，并且灵活性强。

作者邹秋波吴为李之棠

机构地区华中科技大学计算机科学与技术学院

出处《通信学报》 EI CSCD 北大核心 2005年第B01期158-162,共5页 Journal on Communications

关键词防火墙内容过滤 BLOOM FILTER 误报

参考文献3

1Bloom Filters - the math[EB/OL], http://www.cs.wisc.edu/-cao/papers/summary-caehe/node8.html.
2FAN L, CAO P, ALMEIDA J, et al. Summary cache: A scalable widearea web cache sharing protocol[J]. IEEE/ACM Transactions on Networking, 2000, 8 (3): 281-293.
3RAMAKRISHNA M, FU E, BAHCEKAPILI E. A performance study of hashing functions for hardware applications[A]. Proc 6th Int'i Conf Computing and Information[C]. 1994. 1621-1636.

1张有东,王建东,叶飞跃,陈惠萍,李涛.网络取证及其应用技术研究[J].小型微型计算机系统,2006,27(3):558-562. 被引量：10
2BLOOM B H. Space/time trade-offs in hash coding with allowable errors [ J]. Communications of the ACM, 1970, 13 (7) : 422 -426.
3DIETZFELBINGER M, PAGH R. Succinct data dtructures for retrieval and approximate membership [ C]// Proceedings of the 35th International Colloquium on Automata, Languages and Programming, LNCS5125. Berlin: Springer-Verlag, 2008:385-396.
4CHARLES D, CHELLAPILLA K. Bloomier filters: A second look [ C]// Algorithms-ESA 2008: 16th Annual European Symposium, LNCS 5193. Berlin: Springer-Verlag, 2008:259-270.
5BRODER A, MITZENMACHER M. Network applications of bloom filters: A survey [J]. Internet Mathematics, 2004, 1(4): 485- 509.
6杨波.现代密码学[M].2版.北京:清华大学出版社,2007.
7Shanmugasundaram K.ForNet:A distributed forensic network[C]//The Second International Workshop on Mathematical Metheds,Medels and Architectures for Computer Networks Security,St.Peteraburg,Russia,October 2003.
8Bloom B.Space/time trade-off in hash coding with allowable errors[J].Communication of the ACM,1970,13(7):422-426.
9Bloom falter-the math[EB/OL].http://www.cs.wisc.edu/-cao/papers/summary-caeche/node8.html.
10Shanmugasundaram K,Bronnimann H,Memon N.Payloed attribution via hierarchical Bloom filter[R].Department of Computer Science Polytechnics University Brooklyn,New York,2004.

通信学报

2005年第B01期

内容加载中请稍等...