期刊文献+

偏态数据流中的Bloom Filters自适应机制研究 被引量:1

Research of the Bloom Filters Adaptive Mechanism in Skewed Traffic
下载PDF
导出
摘要 针对Count Bloom Filters(CBF)在对偏态分布的网络数据流进行频度检测时,其使用的固定位数的计数器容易溢出的不足,提出了一种自适应性Bloom Filters(Adaptive Bloom Filters ABF),ABF使用可扩展的逻辑计数器替代CBF中大小固定的物理计数器进行计数,逻辑计数器由数目动态变化的若干个物理计数器组成,初始状态逻辑计数器等同于物理计数器,但逻辑计数器在频度数值上溢时会自适应扩展,覆盖其外部的物理计数器,增加数值容量,保证数值的测量准确性.实验表明ABF能够更好地适应检测频度的变化,并且不显著增加误判率,在对数据偏态分布的频度测量场合比其它Count Bloom Filters更具有优势. To overcome the shortcoming the counters of Count Bloom Filters are easy to be overflow when CBF counts the multiplicity of items in many emerging applications data streams with skewed distributions, this paper proposes an Adaptive Count Bloom Filter (ABF) ,which uses a scaleable logical counter instead of the fixed size physical counter and the logical counter consists of some physical counters. In the initial stage the logical counter is similar to the physical counter, but while the counter becomes overflow the logical counter will override the external counter to increase its capability to assure the right value. The experimental results show that ABF adapts to the change of multiplicity of items well and the probability of error of ABF does not get a remarkable worse, so ABF outperforms most other Count Bloom Filters on counting multiplicity of items in skewed distributions traffic.
作者 张伟 王绍棣
出处 《小型微型计算机系统》 CSCD 北大核心 2008年第9期1609-1615,共7页 Journal of Chinese Computer Systems
基金 国家“八六三”高技术研究发展计划基金项目(2005AA775050)资助
关键词 BLOOM FILTERS 频度 偏态 流量 bloom filters multiplicity skewed traffic
  • 相关文献

参考文献2

二级参考文献37

  • 1Postel J.Transmission control protocol,RFC793.Internet Society,1981.
  • 2Koloniari K,Pitoura E.Bloom filters for hierarchical data.In:Proc.of the 5th Int'l Workshop on Distributed Data and Structures (WDAS).2003.
  • 3Bernard 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.
  • 4Little MC,Speirs NA,Shrivastava SK.Using bloom filters to speed-up name lookup in distributed systems.The Computer Journal,2002,45(6):645-652.
  • 5Chin-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.
  • 6Sarang 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.
  • 7Andrei B,Michael M.Network applications of bloom filters:A survey.Internet Mathematics,2003,1(4):485-509.
  • 8Kohler 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.
  • 9http://tracer.csl.sony.co.jp/mawi/
  • 10http://tracer.csl.sony.co.jp/mawi/samplepoint-B/20050107/200501070000.html

共引文献47

同被引文献9

  • 1余敏,李战怀,张龙波.P2P数据管理[J].软件学报,2006,17(8):1717-1730. 被引量:17
  • 2Napster. Napster-file sharing system [ EB/OL]. http:// www. napster.com/, 2008-12-10.
  • 3梁宏恩.Gnutella协议中文版[EB/OL].http://dev.csdn.net/article/14/14530.shtm,2008-12-10.
  • 4RFC 1247 & RFC 1583. OSPF Version 2 [S/OL]. http:// www. faqs. org/rfcs/rfel247. html, 2008-12-10.
  • 5Karlsson M, Karamanolis K, Zhu Xiaoyun.Triage: performance differentiation for storage systems using adaptive control[J]. ACM Transactions on Storage, 2005, 1 (4) : 457-480.
  • 6Stoica I, Morris R, Karger D, et al. Chord:a scalable peer-to- peer lookup service for internet applications [C]//Proc of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SigComm). New York: ACM Press, 2001 : 149-160.
  • 7李馨,谢长生,曹强.自适应分布式存储系统设计[J].计算机工程与科学,2007,29(9):140-142. 被引量:1
  • 8林晶,黄青松,张晶.基于改进MD5算法的数据篡改检测方法[J].计算机工程与应用,2008,44(33):148-150. 被引量:5
  • 9徐非,杨广文,鞠大鹏.基于Peer-to-Peer的分布式存储系统的设计[J].软件学报,2004,15(2):268-277. 被引量:45

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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