当前位置: X-MOL 学术IEEE Trans. Parallel Distrib. Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Fast and Accurate Traffic Measurement with Hierarchical Filtering
IEEE Transactions on Parallel and Distributed Systems ( IF 5.6 ) Pub Date : 2020-10-01 , DOI: 10.1109/tpds.2020.2991007
Haibo Wang , Hongli Xu , Liusheng Huang , Yutong Zhai

Sketches have been widely used to record traffic statistics using sub-linear space data structure. Most sketches focus on the traffic estimation of elephant flows (i.e., heavy hitters) due to their importance to many network optimization tasks, e.g., traffic engineering and load balancing. In fact, the information of aggregate mice flows (e.g., all the mice flows with the same source IP) is also crucial to many security-associated tasks, e.g., DDoS detection and network scan detection. However, the previous solutions, e.g., measuring each individual flow or using multiple sketches for independent measurement tasks, will result in worse estimation error or higher computational overhead. To conquer the above disadvantages, we propose an accurate traffic measurement framework with multiple filters, called Sketchtree, to efficiently measure both elephant flows and aggregate mice flows. These filters in Sketchtree are organized in a hierarchical manner, and help to alleviate the hash collision and improve the measurement accuracy, as the number of flows through hierarchical filters in turn will be decreased gradually. We also design some mechanisms to improve the resource utilization efficiency. To validate our proposal, we have implemented Sketchtree and conducted experimental evaluation using real campus traffic traces. The experimental results show that Sketchtree can increase the processing speed by 100 percent, and reduce the measurement error by over 30 percent compared with state-of-the-art sketches.

中文翻译:

使用分层过滤进行快速准确的流量测量

草图已被广泛用于使用亚线性空间数据结构记录交通统计。由于它们对许多网络优化任务(例如流量工程和负载平衡)的重要性,大多数草图都集中在大象流(即重击者)的流量估计上。事实上,聚合小流的信息(例如,所有具有相同源IP的小流)对于许多与安全相关的任务(例如DDoS检测和网络扫描检测)也很重要。然而,以前的解决方案,例如,测量每个单独的流或使用多个草图进行独立的测量任务,将导致更严重的估计误差或更高的计算开销。为了克服上述缺点,我们提出了一种具有多个过滤器的精确流量测量框架,称为 Sketchtree,有效地测量大象流和聚合老鼠流。Sketchtree 中的这些过滤器以分层方式组织,有助于减轻哈希冲突并提高测量精度,因为依次通过分层过滤器的流数将逐渐减少。我们还设计了一些机制来提高资源利用效率。为了验证我们的提议,我们实施了 Sketchtree 并使用真实的校园交通轨迹进行了实验评估。实验结果表明,与最先进的草图相比,Sketchtree 可以将处理速度提高 100%,并将测量误差降低 30% 以上。并有助于减轻哈希冲突并提高测量精度,因为依次通过分层过滤器的流数将逐渐减少。我们还设计了一些机制来提高资源利用效率。为了验证我们的提议,我们实施了 Sketchtree 并使用真实的校园交通轨迹进行了实验评估。实验结果表明,与最先进的草图相比,Sketchtree 可以将处理速度提高 100%,并将测量误差降低 30% 以上。并有助于减轻哈希冲突并提高测量精度,因为依次通过分层过滤器的流数将逐渐减少。我们还设计了一些机制来提高资源利用效率。为了验证我们的提议,我们实施了 Sketchtree 并使用真实的校园交通轨迹进行了实验评估。实验结果表明,与最先进的草图相比,Sketchtree 可以将处理速度提高 100%,并将测量误差降低 30% 以上。我们已经实施了 Sketchtree 并使用真实的校园交通轨迹进行了实验评估。实验结果表明,与最先进的草图相比,Sketchtree 可以将处理速度提高 100%,并将测量误差降低 30% 以上。我们已经实施了 Sketchtree 并使用真实的校园交通轨迹进行了实验评估。实验结果表明,与最先进的草图相比,Sketchtree 可以将处理速度提高 100%,并将测量误差降低 30% 以上。
更新日期:2020-10-01
down
wechat
bug