中圖分類號：TP393.1
文獻標識碼：A
DOI:10.19358/j.issn.2097-1788.2023.07.007
引用格式：桂丹萍，費揚.基于圖論算法的網(wǎng)絡通信異常節(jié)點識別［J］.網(wǎng)絡安全與數(shù)據(jù)治理，2023，42（7）：43-48.

Identification of abnormal nodes in network communication based on graph theory algorithm

Abstract： The traditional methods of identifying abnormal nodes in network communication, which rely on rules and signatures, or methods that only use partial graphical features, are limited when identifying key users. An anomaly node detection algorithm based on graph theory is proposed in this paper. Firstly local area network datasets collected offline are used to build a graph network; multiple graph features are analyzed to locate abnormal nodes in the network and analyze their potential abnormal behavior; secondly, experiments are conducted to test the detection effect on public network datasets. As a result of the final test results, it has proven to be efficient, convenient, and practical in locating abnormal nodes in network communication.

Key words : graph theory algorithm; abnormal detection; graph network generation; graph feature analysis