期刊文献+

基于多维计数型布鲁姆过滤器的大流检测机制 被引量:9

A Mechanism of Identifying Heavy Hitters Based on Multi-dimensional Counting Bloom Filter
下载PDF
导出
摘要 高速网络环境中,实时、准确地提取大流量对于网络安全和网络管理具有重要意义。该文针对传统的流量测量方法受计算资源和存储资源的限制,提出了一种基于多维计数型布鲁姆过滤器(Multi-Dimensional Counting Bloom Fliter,MDCBF)的大流检测机制。它将1维的计数型布鲁姆过滤器(Counting Bloom Fliter,CBF)结构,扩展到支持多维业务流表示、查询和统计计数的MDCBF结构。基于"Apriori原理",通过对MDCBF实施重正化,实现了用户自定义的大流检测。并能自适应地配置CBF参数,允许测量误差控制在预定义的范围内。基于计算机产生的模拟数据和实际互联网数据进行了仿真实验,结果显示:该方法既能获得较小的测量误差,又能获得较高的空间利用率。 In high-speed network,identifying heavy hitters precisely in time serves as great significance for both network security and network management.In order to circumvent the deficiency of the limitted computing and storage abilities in traditional traffic measurement,a novel mechanism called identifying heavy hitters based on Multi-Dimensional Counting Bloom Filter(MDCBF) is proposed.Extending the standard structure of Counting Bloom Filter(CBF) to multi-dimensional one,the mechanism can not only represent,query and count traffic flows,but also sustain real time multi-granularity measurement.Based on Apriori principle,it can realize the identification of heavy hitters through implementing renormalization of MDCBF.Experiments are conducted based on the data either randomly produced by computer or sampled from the real network trace.Results demonstrate that the proposed mechanism can achieve finer space saving without sacrificing accuracy.
出处 《电子与信息学报》 EI CSCD 北大核心 2010年第7期1608-1613,共6页 Journal of Electronics & Information Technology
基金 国家863计划项目(2007AA01z2a1) 国家973规划项目(2007CB307102)资助课题
关键词 网络测量 流量测量 布鲁姆过滤器 Apriori原理 大流检测 Network measurement Traffic measurement Bloom Filter Apriori principle Identifying heavy hitters
  • 相关文献

参考文献11

  • 1Estan C and Varghese G. New directions in traffic measurement and accounting: Focusing on elephants, ignoring the mice[J]. ACM Transactions on Computer Systems, 2003, 21(3): 270-313.
  • 2Cisco Netflow. http://www.cisco.com/warp/public/732/ Tech/nmp/net flow/index.shtml. 2008.
  • 3Sun Yong, Zhang Zhi-bin, Guo Li, Bai Shuo, and Tan Jian-long. An effective algorithm for counting active flows based on loop filter[C]. Proc. International Conference on Networking, Architecture, and Storage, IEEE Computer Society, Chongqing China, 2008: 104-109.
  • 4王洪波,程时端,林宇.高速网络超连接主机检测中的流抽样算法研究[J].电子学报,2008,36(4):809-818. 被引量:13
  • 5龚俭,彭艳兵,杨望,刘卫江.基于BloomFilter的大规模异常TCP连接参数再现方法[J].软件学报,2006,17(3):434-444. 被引量:24
  • 6Fan Li, Cao P, Almeida J, and Broder A. Summary cache : A scalable wide--area web cache sharing protocol[J]. IEEE/ A CM Transactions on Networking, 2000, 8(3): 281-293.
  • 7Saar Cohen and Yossi Matias. Spectral Bloom Filters[C]. Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, San Diego. California, 2003: 241-252.
  • 8谢鲲,闵应骅,张大方,谢高岗,文吉刚.分档布鲁姆过滤器的查询算法[J].计算机学报,2007,30(4):597-607. 被引量:14
  • 9Xie K, Min Y H, and Zhang D F, et al.. A Scalable Bloom filter for membership queries[C]. Proc of IEEE Globlecom. Washington D.C. USA, 2007: 543-547.
  • 10Estan C, Keys K, Moore D, and Varghese G. Building a Better Netflow[C]. Proc. SIGCOMM'04, Portland, ACM Press, 2004: 245-256.

二级参考文献74

  • 1姜彩萍,李子木,杨凤杰.集中管理式Web缓存系统及性能分析[J].小型微型计算机系统,2004,25(8):1428-1431. 被引量:10
  • 2Postel J.Transmission control protocol,RFC793.Internet Society,1981.
  • 3Koloniari K,Pitoura E.Bloom filters for hierarchical data.In:Proc.of the 5th Int'l Workshop on Distributed Data and Structures (WDAS).2003.
  • 4Bernard C,Joe K,Ronitt R,Ayellet T.The bloomier filter:An efficient data structure for static support lookup tables.In:Proc.of the 15th Annual ACM-SIAM Symp.on Discrete Algorithms Table of Contents.Philadelphia:Society for Industrial and Applied Mathematics,2004.30-39.
  • 5Little MC,Speirs NA,Shrivastava SK.Using bloom filters to speed-up name lookup in distributed systems.The Computer Journal,2002,45(6):645-652.
  • 6Chin-Chen C,Tian-Fu L,Jyh-Jong L.Partition search filter and its performance analysis.Journal of Systems and Software,1999,47(1):35-43.
  • 7Sarang D,Praveen K,David ET.Longest prefix matching using bloom filters.In:Proc.of the Conf.on SIGCOMM.New York:ACM Press,2003.201-212.
  • 8Andrei B,Michael M.Network applications of bloom filters:A survey.Internet Mathematics,2003,1(4):485-509.
  • 9Kohler E,Li JY,Paxson V,Shenker S.Observed structure of addresses in IP traffic.In:Internet Measurement Workshop 2002.New York:ACM Press,2002.253-266.
  • 10http://tracer.csl.sony.co.jp/mawi/

共引文献43

同被引文献86

引证文献9

二级引证文献57

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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