作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (20): 116-118. doi: 10.3969/j.issn.1000-3428.2007.20.040

• 网络与通信 • 上一篇    下一篇

基于Sample-CBF技术的长流识别实现

刘卫江1,2,白 磊3,景 泉3   

  1. (1. 大连海事大学计算机科学与技术学院,大连 116026;2. 东南大学计算机科学与技术学科博士后流动站,南京 210096; 3. 渤海大学信息科学与工程学院,锦州 121003)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-10-20 发布日期:2007-10-20

Realization of Elephant Flows Identification Based on Sample-CBF Technique

LIU Wei-jiang1,2, BAI Lei3, JING Quan3   

  1. (1. School of Computer Science and Technology, Dalian Maritime University, Dalian 116026; 2. Post Doctoral Station for Computer Science and Technology, Southeast University, Nanjing 210096; 3. School of Information Science and Engineering, Bohai University, Jinzhou 121003)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-10-20 Published:2007-10-20

摘要: 根据网络上的流统计呈现很强的重尾分布的特性,该文提出了使用周期抽样和counting bloom filter(CBF)技术相结合的方法,即Sample-CBF方法来实现长流识别,并根据抽样策略的不同,将其具体化为两种方法:PSample-CBF方法和FSample-CBF方法。理论分析和仿真结果表明,在存在可容忍流长度测量误差的条件下,两种方法都可以准确识别长流,有效地减少存储空间和提高处理速度。

关键词: 周期抽样, 长流, 哈希

Abstract: According to the characteristics that the network flow statistics show a strong heavy-tail distribution, this paper puts forward a method using Sample-CBF to realize elephant flows identification, which combines period sampling and counting bloom filter(CBF) technique. According to the different sampling strategies, the method is translated into two specific methods: PSample-CBF method and FSample-CBF method. Theoretical analysis and simulation result indicate under the condition of existing some tolerable measurement error about the length of flows, the two methods both can identify elephant flows accurately, reduce the storage space and improve the processing speed efficiently.

Key words: Period sampling, elephant flow, Hash

中图分类号: