The deployment of modern network applications is increasing the network size and traffic volumes at an unprecedented pace. Storing network-related information (e.g., traffic traces) is key to enable efficient network management. However, this task is becoming more challenging due to the ever-increasing data transmission rates and traffic volumes. In this paper, we present a novel method for network traffic compression that exploits spatial and temporal patterns naturally present in network traffic. We consider a realistic scenario where traffic measurements are performed at multiple links of a network topology using tools like SNMP or NetFlow. Such measurements can be seen as multiple time series that exhibit spatial and temporal correlations induced by the network topology, routing or user behavior. Our method leverages graph learning methods to effectively exploit both types of correlations for traffic compression. The experimental results show that our solution is able to outperform GZIP, the \textit{de facto} traffic compression method, improving by 50\%-65\% the compression ratio on three real-world networks.
翻译:现代网络应用的部署正在以前所未有的速度增加网络规模和流量。存储网络相关信息(如交通轨迹)是高效网络管理的关键。然而,由于数据传输率和流量的不断增加,这项任务正变得更加艰巨。在本文件中,我们提出了一个利用网络交通中自然存在的空间和时间模式的网络交通压缩新方法。我们考虑了一种现实的情景,即利用SNMP或NetFlow等工具对网络地形多链接进行交通量测量。这些测量可被视为多个时间序列,显示由网络地形、路由或用户行为引发的空间和时间相关性。我们的方法利用图表学习方法有效地利用两种类型的交通压缩相关数据。实验结果表明,我们的解决方案能够超越GZIP,即“textit{deactual}交通压缩法”,以50-65 ⁇ 的速度改进三个真实世界网络的压缩率。