Skip to content

Edge weight concentration overcomes node degree blindness in graph based network intrusion detection

Sep 2026 · Discover Networks · Vol 2 · 0 citations · 20 references
Complex Network Analysis Techniques Advanced Graph Neural Networks

Abstract

Graph-based network intrusion detection almost universally represents attacker behavior through node-centric structural features – degree, centrality, embeddings from graph neural networks – which implicitly assume that an attacker’s identity is visible as a distinct node in the host-communication graph. We show that this assumption breaks under a common, realistic condition: network address translation (NAT) or perimeter aggregation, which collapses many real hosts onto a small number of gateway addresses. Using real, labeled flow data from the CICIDS2017 benchmark (Friday afternoon distributed denial-of-service capture, 225,745 flows), we construct time-windowed directed host-communication graphs and show that, at the observed collapse ratio, node-degree features are statistically indistinguishable from benign traffic (Mann-Whitney \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p=0.12$$\end{document}–0.83 across four window sizes, which are nested aggregations of one underlying one-minute-resolution timestamp field rather than independent replications) while edge-weight concentration separates attack from benign windows with p ranging from \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$3.9\times 10^{-12}$$\end{document} at 60 seconds to 0.017 at 10 minutes (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n=3$$\end{document} attack windows at that resolution). Rather than inferring causation from one fixed collapse ratio, we directly test it with a controlled semi-synthetic sweep that redistributes the real attack’s flow volume across a varying number k of synthetic source identities: node-degree separation rises monotonically from chance (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\text {AUC}=0.61$$\end{document}) to perfect (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\text {AUC}=1.00$$\end{document}) as k grows from 1 to 128, while edge-weight separation is perfect only near full collapse (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k\le 2$$\end{document}) and falls to near-chance once attacker identity becomes even partially visible (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k\ge 4$$\end{document}) – direct evidence that the two feature families are complementary along the collapse axis rather than one uniformly dominating the other. At the flow level, a compact graph-context feature set – with a near-tautological heaviest-edge indicator removed and evaluated under window-grouped cross-validation to prevent information leakage between flows sharing a time window – reaches F1 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$=0.981$$\end{document} at 9 dimensions against a 78-dimensional CICFlowMeter baseline’s F1 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$=0.998$$\end{document}, at roughly one-tenth the training cost. We report this as a single-attack-type case study in which the identity-collapse mechanism is now measured directly rather than asserted, and we state explicitly what further validation against other attack archetypes would require.

Read PDF

Similar papers

#graph neural networks Open access Sep 2026

Online intrusion detection in computer networks using edge-aware attentive graph neural network

This study presents an intrusion detection framework based on a GNN that represents packet-flow data as communication graphs constructed over temporally segmented time windows, using a time-window-driven graph construction method that effectively models the temporal evolution of communication patterns while maintaining...

Áron Kiss, K. Nehéz, O. Hornyák · 0 citations
Open access Oct 2026

GraphINR-IDS: Graph-Topology-Aware implicit neural reconstruction for zero-day intrusion detection in encrypted network traffic

Payload encryption has shifted network intrusion detection towards flow-metadata analysis, yet most metadata-based detectors represent traffic through fixed feature windows, token sequences or periodic graph snapshots, discretising traffic before learning and binding the detector to a granularity selected in advance. G...

D. P., H. A. · 0 citations
Open access Aug 2026

MaGOS-IDS: A Mahalanobis-Enhanced OpenMax Method for Graph Neural Network-Based Intrusion Detection

MaGOS-IDS is proposed, which extracts topology-aware embeddings with an edge-aware GCN that fuses flow-level edge features directly into message passing, whitens each class with a regularized Mahalanobis distance so the reject decision respects per-class variance and correlation, and calibrates a per-class EVT tail on...

Thanh T. Nguyen, Minho Park · 0 citations
Open access 2026

DMGCRL: Dynamic Multi-Scale Graph Contrastive Representation Learning for Network Intrusion Detection

Dynamic Multiscale Graph Contrastive Representation Learning (DMGCRL), a self-supervised framework that hierarchically models network intrusions at different levels, is proposed, which consistently outperforms SOTA methods in network intrusion detection.

Raeed Al-Sabri, Abdullatif Albaseer, Mohamed M. Abdallah et al. · 0 citations
Open access 2026

SHAP-GSD: Temporal Multi-Granular Explanation Method for Graph Neural Networks in Network Intrusion Detection

SHapley Additive exPlanations on Graph-Structured Data (SHAP-GSD), a temporally constrained Shapley framework that decomposes each alert into three attribution layers, is presented, the first Shapley formulation to simultaneously deliver temporally faithful, multi-granularity attribution across all three evidence dimen...

Riko Luša, Damir Pintar, Mihaela Vranić · 0 citations
Open access Sep 2026

IOTTRUST: graph-based anomaly detection for IoT intrusion using network flow topology and community structure analysis on UNSW-NB15

IOTTRUST is presented, a graph-augmented intrusion detection framework for IoT networks that constructs a directed network flow graph from the UNSW-NB15 dataset and enriches per-flow machine learning with 24 graph-derived topology features computed per source and destination IP.

Nachaat Mohamed, Hamed Taherdoost · 0 citations

Related blog posts

Microsoft Research Blog Jul 13, 2026

Verifying Rust cryptography in SymCrypt, from standards to code

Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.