Worm detection and prevention based on network segmentation algorithm

Shanhong Zhu

COMPUTER MODELLING & NEW TECHNOLOGIES 2015 19(1B) 29-32

School of Computer and Information Engineering, Xinxiang University, Henan, China
International School of Software, Wuhan University, Wuhan, China

Due to large space demanding and time-consuming, as the Internet is large and complex, the detection and prevention of the worm has many engineering constraints factors, the classic graph theory algorithms cannot suitable for solving some problems in the large-scale network. Sub-graphs of vertices have a higher density of edges within them while a lower density of edges between sub-graphs. To solve large-scale network analysis, the method of using DFS network segmentation algorithm based on network topology was proposed by analyzing the study of graph depth-first search (Depth First Search, referred to as DFS) segmentation algorithm, and thus obtain a description of the network connectivity of undirected connected graph G (V, E).this provide a strong theoretical support for fast access network backbone node. The result of experiments shows that the proposed method is effective.