基于滑动窗口的资源可控流量测量算法  

Resource Constraints Algorithm for Traffic Measurement Based on Sliding Window

作　　者：张震[1] 汪斌强[1] 陈庶樵[1] 周粳迪[1] 

机构地区：[1]国家数字交换系统工程技术研究中心,郑州450002

出　　处：《计算机工程》2010年第3期122-124,共3页Computer Engineering

基　　金：国家"863"计划基金资助项目"目标导向课题"(2007AA01z2a1)

摘　　要：针对高速链路中流量测量缺乏可扩展性的问题,提出一种在线挖掘频繁流的算法。通过采用"滑动窗口"机制,构造流抽样函数,自适应地设置抽样门限的方法,实现流大小的无偏估计。基于实际的互联网数据进行仿真实验,结果表明,该算法在保证准确性的同时,具有自适应性和资源可控性。Aiming at the deficiency of traffic measurement lacking scalability in high-speed link, this paper develops an algorithm to mine frequent flows over online packet stream. Adopting the mechanism of sliding window, the algorithm constructs a sampling function and configures adaptive thresholds to achieve unbiased estimates of flow size. Experiments are conducted based on real network traces. Results demonstrate that the proposed method can achieve adaptability and controllability of resource consumption without sacrificing accuracy.

关 键 词：流量测量 滑动窗口 自适应门限 资源可控性 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]