Network service community discovery and global representation based on network mapping

Abstract

The network topology is marked with the device type, which is difficult to reflect the service relationship between the device nodes. Aiming at this problem, this paper proposes a network service node division algorithm based on service mapping. The algorithm judges the ownership of the service community through the service mapping relationship between network nodes, and finds the key nodes of network services and the subordinate relationship between nodes. This paper introduces virtual community based on traditional membership matrix. The network service community membership influence degree algorithm not only give the community membership degree of nodes, but also reflect the global influence degree of nodes, providing a basis for the selection of key network nodes in network security. In the experiment based on LFR network, this paper compares the algorithm sensitivity and performance with similar algorithms, and validates the effectiveness of algorithm partitioning in the Internet2 OS3E simulation experiment by simulating denial of service attacks. The comparative experimental results show that the service mapping algorithm has the characteristics of low sensitivity and high practicability in threshold selection, and its performance is better than that of similar algorithms. The simulation results show that the service community partition is effective and can give the correlation between node services.

Keywords

• network service|service node mapping|overlapping community discovery|membership matrix|global impact