Abstract

We present a study of deep learning applied to the domain of network traffic data forecasting. This is a very important ingredient for network traffic engineering, e.g., intelligent routing, which can optimize network performance, especially in large networks. In a nutshell, we wish to predict, in advance, the bit rate for a transmission, based on low-dimensional connection metadata ("flows") that is available whenever a communication is initiated. Our study has several genuinely new points: First, it is performed on a large dataset (~50 million flows), which requires a new training scheme that operates on successive blocks of data since the whole dataset is too large for in-memory processing. Additionally, we are the first to propose and perform a more fine-grained prediction that distinguishes between low, medium and high bit rates instead of just "mice" and "elephant" flows. Lastly, we apply state-of-the-art visualization and clustering techniques to flow data and show that visualizations are insightful despite the heterogeneous and non-metric nature of the data. We developed a processing pipeline to handle the highly non-trivial acquisition process and allow for proper data preprocessing to be able to apply DNNs to network traffic data. We conduct DNN hyper-parameter optimization as well as feature selection experiments, which clearly show that fine-grained network traffic forecasting is feasible, and that domain-dependent data enrichment and augmentation strategies can improve results. An outlook about the fundamental challenges presented by network traffic analysis (high data throughput, unbalanced and dynamic classes, changing statistics, outlier detection) concludes the article.


Original document

The different versions of the original document can be found in:

http://dx.doi.org/10.1007/978-3-030-30490-4_40 under the license http://www.springer.com/tdm
https://arxiv.org/abs/1909.04501,
https://arxiv.org/pdf/1909.04501v1,
https://link.springer.com/chapter/10.1007%2F978-3-030-30490-4_40,
https://export.arxiv.org/pdf/1909.04501,
http://export.arxiv.org/abs/1909.04501,
https://rd.springer.com/chapter/10.1007/978-3-030-30490-4_40,
https://academic.microsoft.com/#/detail/2973082347
Back to Top

Document information

Published on 01/01/2019

Volume 2019, 2019
DOI: 10.1007/978-3-030-30490-4_40
Licence: Other

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?