期刊文献+

基于抽样和Bloom Filters的长流检测

Elephant Flow Detection Based on Sample and Bloom Filters
下载PDF
导出
摘要 长流检测对网络检测和管理有着重要的意义.提出一种基于抽样和Bloom Filters的长流检测算法,首先对报文进行抽样,然后通过Bloom Filters哈希运算,在内存中用临时表和流信息表来判断到达阈值的流并维护其信息,满足了高速网络环境下长流检测的要求,在保证测量精度的同时有效得控制了资源消耗.实验分析表明,和已有的方法相比,具有简单易行、资源可控等优点. Detecting elephant flows is vital to network operation and management. This paper proposes a method based on sampie and Bloom filters to identify elephant flow. It samples the packets first, then employs Bloom filters hash structure, temporary table and flow information table to identify elephant flows and maintain their records, which meets high-speed network's demand and controls resources consumption effectively without sacrificing accuracy. The experiment analysis indicates the proposed method can achieve simplicity and controllability compared with other methods.
出处 《小型微型计算机系统》 CSCD 北大核心 2009年第3期451-453,共3页 Journal of Chinese Computer Systems
基金 国防基础研究基金项目(A1420061266)资助 2006年江苏省高校"青蓝工程"项目资助
关键词 网络流量测量 抽样 BLOOM FILTERS 长流检测 network traffic measurement sampling Bloom filters elephant flow detecting
  • 相关文献

参考文献8

  • 1Fang W, Peterson L. Inter-AS traffic patterns and their implications[C]. In Proc. of IEEE GLOBECOM' 99. Riode Janeireo, Brazil, December 1999, 3: 1859-1868.
  • 2Zhou Ming-zhong, Gong Jian, Ding Wei, et al. Long flows. information statistics based on MGCBF algorithm[J]. Journal of Southeast University (Natural Science Edition), 2006, 36(3): 472-476.
  • 3Estan C, Varghese G. New directions in traffic measurement and accounting., focusing on the elephants, ignoring the mice [J]. ACM Transactions on Computer Systems, 2003, 21 (3) : 270-313.
  • 4Mori T, Uehida M, Kawahara R. Identifying elephant flows through periodically sampled packets[C]. In Proe. ACM SIGCOMM IMC' 04, Italiy, 2004:115-120.
  • 5Aguilar-Saborit J, Trancoso P, Muntes-Mulero V. Dynamic count filters[J]. ACM SIGMOD Record, 2006, 35(1): 26-32.
  • 6Andrei Border, Michael Mitzenmacher. Network applications of bloom filters: a survey [J]. Internet Math, 2003, 1(4) : 485- 509.
  • 7Duffield N G, Lund C, Thorup M. Estimating flow distributions from sampled flow statistics[J]. IEEE/ACM Transactions on Networking, USA, 2005,13(5):933-946.
  • 8http ://pma. nlanr, net/Special/2007-4-10.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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