Network Traffic Prediction Based on the Feature of Newly-Generated Network Flows

Shaohe Li, Junping Song, Luyang Xu, Yahui Hu, Wanming Luo, Xu Zhou
{"title":"Network Traffic Prediction Based on the Feature of Newly-Generated Network Flows","authors":"Shaohe Li, Junping Song, Luyang Xu, Yahui Hu, Wanming Luo, Xu Zhou","doi":"10.23919/ifipnetworking55013.2022.9829764","DOIUrl":null,"url":null,"abstract":"Network traffic prediction is essential for intelligent network management, such as resource reservation and burst warning. Existing prediction approaches are vulnerable in accurately capturing the sudden surge or plunge, uniformly denoted as the traffic burst. To solve this problem, we extract the time series of the number of newly-generated network flows (NoNGF) from the network flow information, explaining the intrinsic mechanism of network traffic bursts. We use time-lagged cross-correlation analysis to identify directionality between the NoNGF series and traffic series. It proves that we can perceive the future fluctuation and burst of network traffic by NoNGF in advance. The comprehensive prediction experiments of the whole network traffic and three application-level network traffic demonstrate that our proposed approach exhibits a significant performance improvement over the original LSTM and TCN models. Our approach can accurately capture the moment of network burst and the predicted value much more precisely when the burst occurs. In summary, our proposed traffic prediction based on NoNGF can significantly improve the prediction accuracy, especially for network burst traffic.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"34 1","pages":"1-8"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Edutech","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ifipnetworking55013.2022.9829764","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Network traffic prediction is essential for intelligent network management, such as resource reservation and burst warning. Existing prediction approaches are vulnerable in accurately capturing the sudden surge or plunge, uniformly denoted as the traffic burst. To solve this problem, we extract the time series of the number of newly-generated network flows (NoNGF) from the network flow information, explaining the intrinsic mechanism of network traffic bursts. We use time-lagged cross-correlation analysis to identify directionality between the NoNGF series and traffic series. It proves that we can perceive the future fluctuation and burst of network traffic by NoNGF in advance. The comprehensive prediction experiments of the whole network traffic and three application-level network traffic demonstrate that our proposed approach exhibits a significant performance improvement over the original LSTM and TCN models. Our approach can accurately capture the moment of network burst and the predicted value much more precisely when the burst occurs. In summary, our proposed traffic prediction based on NoNGF can significantly improve the prediction accuracy, especially for network burst traffic.
基于新生成网络流特征的网络流量预测
网络流量预测是实现资源预留、突发预警等智能网络管理的重要手段。现有的预测方法难以准确地捕捉到统一表示为流量突发的突发事件。为了解决这一问题,我们从网络流量信息中提取新生成网络流(NoNGF)数量的时间序列,解释网络流量突发的内在机制。我们使用时滞互相关分析来识别NoNGF序列和交通序列之间的方向性。这证明我们可以提前感知未来网络流量的波动和突发。对整个网络流量和三个应用层网络流量的综合预测实验表明,我们提出的方法比原始的LSTM和TCN模型具有显著的性能改进。该方法可以准确地捕捉网络突发时刻,更精确地捕捉突发发生时的预测值。综上所述,我们提出的基于NoNGF的流量预测可以显著提高预测精度,特别是对网络突发流量的预测精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
审稿时长
4 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书