

























Abstract:In this paper, we propose a proof-of-concept Graph Neural Network model that can successfully predict network flow-level traffic (NetFlow) by accurately modelling the graph structure and the connection features. We use sliding-windows to split the network traffic in equal-sized heterogeneous bidirectional graphs containing IP, Port, and Connection nodes. We then use the GNN to model the evolution of the graph structure and the connection features. Our approach shows superior results when identifying the Port and IP to which connections attach, while feature reconstruction remains competitive with strong forecasting baselines. Overall, our work showcases the use of GNNs for per-flow NetFlow prediction.
| Comments: | 3 figures, 6 pages |
| Subjects: | Networking and Internet Architecture (cs.NI); Machine Learning (cs.LG) |
| Cite as: | arXiv:2604.20483 [cs.NI] |
| (or arXiv:2604.20483v1 [cs.NI] for this version) | |
| https://doi.org/10.48550/arXiv.2604.20483 arXiv-issued DOI via DataCite (pending registration) |
From: Georgios Anyfantis [view email]
[v1]
Wed, 22 Apr 2026 12:14:29 UTC (650 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。