期刊文献+

一种大象流两级识别方法 被引量:9

A two-level method for elephant flow identification
下载PDF
导出
摘要 基于大象流的识别准确度高且开销低,对于解决SDN流量管理过程中控制器单点故障问题具有重要意义。针对现有大象流识别方法识别开销大的问题,提出一种大象流两级识别方法。该方法在第一阶段提出基于TCP发送队列的可疑大象流识别算法,在第二阶段提出基于流持续时间的真实大象流识别算法;第一阶段是在端系统中识别可疑大象流,用于降低第二阶段真实大象流识别过程中SDN控制器所需监测的网络流数量。实验分析表明,在保证大象流识别的高准确度前提下,大象流两级识别方法较基于采样的大象流识别方法可以降低约85%的控制器识别开销。 The high accuracy and low overhead of elephant flows identification have a great meaning on solving the controller's single point of failure problem in SDN traffic management. Aiming at the problem of high overhead of the existing elephant flows identification method, a two-level method for elephant flows identification was proposed which included a suspicious elephant detection algorithm based on TCP write-queue in the first stage and areal elephant detection algorithm based on flow duration in the second stage. During the first stage, the suspicious elephant flows were identified in the end systems to reduce the amount of flows monitored by the SDN controller at the second stage. Analysis and simulation prove that,under the premise of ensuring the accuracy of elephant flow identification, the two-level method for elephant flows identification reduces about 85% overhead of identification compared with sampling identification method.
出处 《电信科学》 北大核心 2017年第3期36-43,共8页 Telecommunications Science
基金 浙江省公益技术应用研究计划基金资助项目(No.2016C31G2041123) 第56批中国博士后科学基金面上资助项目(No.2014M561693) 国家自然科学基金青年科学基金资助项目(No.61401130)~~
关键词 大象流识别 TCP发送队列 软件定义网络 elephant flow identification TCP sending queue SDN
  • 相关文献

参考文献6

二级参考文献125

  • 1张玉,方滨兴,张永铮.高速网络监控中大流量对象的识别[J].中国科学:信息科学,2010,40(2):340-355. 被引量:11
  • 2金澈清,钱卫宁,周傲英.流数据分析与管理综述[J].软件学报,2004,15(8):1172-1181. 被引量:161
  • 3杜阿宁,程晓明.网络流量分析中的频繁项监测技术研究[J].通信学报,2006,27(2):9-15. 被引量:3
  • 4周明中,龚俭,丁伟,程光.基于MGCBF算法的长流信息统计[J].东南大学学报(自然科学版),2006,36(3):472-476. 被引量:5
  • 5Estan C, Varghesc G. New directions in traffic measurement and accounting:Focusing on elephants, ignoring the mice [J]. ACM Trans on Computer Systems, 2003, 21(3):270- 313.
  • 6Mori T, Uchida M, Kawahara R. Identifying elephant flows through periodically sampled packets [C] //Proc of ACMSIGCOMM2004. New York: ACM, 2004:115-120.
  • 7Duffield N, Lund C, Thorup M. Charging from sampled network usage[C] //Proc of ACM SIGCOMM Workshop Internet Measurement. NewYork:ACM, 2001:245-256.
  • 8Shaikh A, Rexford j, Shin K G. Load-sensitive routing ot long-lived IP flows [C] //Proc of ACM SIGCOMM99. New York: ACM, 1999:215-226.
  • 9Kodialam M, Lakshman T V, Mohanty S. Runs based traffic estimator (RATE): A simple, memory efficient scheme for per-flow rate estimation [C]//Proc of INFOCOM 2004. Los Alamltos, CA:IEEE Computer Society, 2004:1808-1818.
  • 10Hao F, Kodialam M, Lakshman T V, et al. Fast, memory ef/icient trallic estimation by coincidence counting [C] //Proc of INFOCOM 2004. Los AIamitos, CA: IEEE Computer Society, 2004:2080-2090.

共引文献440

同被引文献34

引证文献9

二级引证文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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