期刊文献+

基于LEAST的高速网络大流检测算法 被引量:3

An Elephant Flow Identifying and Measuring Algorithm Based on LEAST in High-speed Network Environment
下载PDF
导出
摘要 针对大流漏检率过高,占用SRAM过大问题,提出了基于最少(LEAST)改进型大流检测算法。主要思想:利用LEAST淘汰机制将小流丢弃使得大流能够被保护,采用窗口-储备策略解决检测大流的公平性问题。通过相关组织所提供的实际互联网数据进行了实验比较,结果显示:与现有算法相比,新算法具有更高的测量准确性,平均大流漏检率降低至0%~0.13%。 In high-speed network environment, ifs very important to extract elephant flow timely and accu- rately for cognizing behavior and law of network. In order to reduce the elephant flow measurement miss- ing rate and overmuch occupation of SRAM, an improved algorithm based on LEAST is proposed. By u- sing LEAST elimination mechanism for discarding the mice flow, the elephant flow can be protected. And Window-Reserve strategy is adopted to ensure the fairness of identifying and measuring elephant flow. Fi- nally, through the comparison between the simulation results and the actual flow data, the result shows that the new algorithm has a higher measurement accuracy and is more practicable, and the elephant flow on the average measurement missing rate is reduced to 0%-0.13%.
出处 《空军工程大学学报(自然科学版)》 CSCD 北大核心 2015年第4期62-65,共4页 Journal of Air Force Engineering University(Natural Science Edition)
基金 陕西省自然科学基金资助项目(2012JZ8005)
关键词 网络测量 大流流量 LEAST淘汰机制 窗口-储备策略 network measuring elephant flow LEAST elimination mechanism window-reserve strategy
  • 相关文献

参考文献9

二级参考文献63

共引文献49

同被引文献31

引证文献3

二级引证文献23

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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