期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

BFPC:一种新型的基于Bloom Filter的报文分类算法 被引量：1

BFPC:A Novel Algorithm for Packet Classification Based on Bloom Filters
下载PDF
导出
摘要 Bloom Filter是一种支持高速数据查询的数据结构,已被广泛应用到各个领域,包括路由查找、串匹配[1]等。本文将重点研究Bloom Filter在报文分类领域中的应用,提出一种新型的报文分类算法——BFPC,阐述BFPC算法的基本思想,并通过实例对该算法进行了描述。最后,对BFPC算法与其他报文分类算法进行了性能比较。 Bloom Filter is a data structure supporting high-speed data query, which is used in many fields of application, including string matching, resource routing, and so on. In this paper, we pay attention to the research on the Bloom Filters in the field of packet classification, present a novel algorithm for packet classification named BFPC, and illuminate the main idea of BFPC especially by the demonstration. Finally BFPC is compared with other algorithms for packet classification on the performance.
作者 孙志刚 白建东 陈一骄
机构地区 国防科技大学计算机学院
出处 《计算机工程与科学》 CSCD 北大核心 2009年第4期4-6,10,共4页 Computer Engineering & Science
基金 国家973计划资助项目(2003CB314802)
关键词 BLOOM FILTER 假阳性 报文分类 BFPC Bloom Filter false positive packet classification BFPC
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献3

二级参考文献42

  • 1[4]V A Srinivasan. Packet classification and filter management system. Twentieth Annual Joint Conf of the IEEE Computer and Communications Societies, Anchorage, AK, USA, 2001. http://ieeexplore.ieee.org
  • 2[5]P Warkhede, S Suri, G Varghese. Fast packet classification for two-dimensional conflict-free filters. Twentieth Annual Joint Conf of the IEEE Computer and Communications Societies, Anchorage, AK, USA, 2001. http://ieeexplore.ieee.org
  • 3[6]A Brodnik, S Carlsson, M Degermark .et al.. Small forwarding tables for fast routing lookups. The ACM SIGCOMM 1997 Conf, Cannes, France, 1997. http://acm.lib.tsinghua.edu.cn/acm/main.nsp?view=ACM
  • 4[7]B Lampson, V Srinivasan, G Varghese. IP lookups using multiway and multicolumn search. The Conf on Computer Communications(IEEE INFOCOMM), San Francisco, California, 1998.
  • 5[8]M Waldvogel, G Varghese, J Turner .et al.. Scalable high-speed IP routing lookups. The ACM SIGCOMM, Cannes, France, 1997. http://acm.lib.tsinghua.edu.cn/acm/main.nsp?view=ACM
  • 6[9]P Gupta, S Lin, N McKeown. Routing lookups in hardware at memory access speeds. In: Proc of the Conf on Computer Communications(IEEE INFOCOMM), San Francisco, California, 1998. http://ieeexplore.ieee.org
  • 7[10]V Srinivasan, G Varghese. Fast IP lookups using controlled prefix expansion.ACM Trans on Computer Systems,1999,17(1):1～40
  • 8[11]R Braden, D Clark, S Shenker. Integrated services in the Internet architecture: An overview. RFC 1633, 1994
  • 9[12]R Braden, E L Zhang, S Berson .et al.. Resource ReSerVation Protocol(RSVP)-Version 1 Function Specification. RFC 2205, 1997
  • 10[13]S Blake, D Black, M Carlson .et al.. An architecture for differentiated services. IETF Internet RFC 2475, 1998

共引文献28

同被引文献12

  • 1孙毅,刘彤,蔡一兵,胡金龙,石晶林.报文分类算法研究[J].计算机应用研究,2007,24(4):5-11. 被引量：9
  • 2Chisvin L, Duckworth R J. Content-addressable and ast sociative memory: Alternatives to the ubiquitous RA [J]. Computer, 1989, 22(7): 51-64.
  • 3Srinivasan V, Varghese G, Suri S, et al. Fast and scala1 ble layer four switching[ M ]. ACM, 1998.
  • 4Gupta P, McKeown N. Packet classification on multiple fields[ J]. ACM SIGCOMM Computer Communication Re- view. ACM, 1999, 29(4): 147-160.
  • 5Singh S, Baboescu F, Varghese G, et al. Packet classifi- cation using multidimensional cutting[C]//Proceedings of the 2003 conference on Applications, technologies, ar- chitectures, and protocols for computer communications. ACM, 2003: 213-224.
  • 6Gupta P, McKeown N. Packet classification using hierar- chical intelligent cuttings[C]//Hot Interconnects VII. 1999 : 34-41.
  • 7Wikipedia. Bloom Filter [ EB/OL]. [ 2014-10-01 ]. ht- tp ://en. wikipedia, org/wiki/Bloom_filter.
  • 8Broder A, Mitzenmaeher M. Network applications of bloom filters : A survey[ J]. Internet mathematics, 2004, 1 (4) : 485-509.
  • 9Pei Cao. Bloom Filters-the math[ EB/OL]. [2014-10- 011. http ://pages. es. wise. edu/- eao/papers/summa- ry-eaehe/node8, html.
  • 10毕夏安,谢高岗,张大方.基于规则集压缩的高效包分类算法[J].计算机应用,2010,30(11):3053-3055. 被引量：2

引证文献1

计算机工程与科学
2009年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部