| CPC H04L 41/12 (2013.01) [H04L 41/142 (2013.01)] | 17 Claims |

|
1. A method for detecting node types in a directed network, the method comprising:
acquiring flow direction feature information of data traffic between network nodes in the directed network, the flow direction feature information including a directed graph of nodes representing the network nodes, the nodes in the directed graph being connected via directed edges, the nodes in the directed graph including peripheral nodes and non-peripheral nodes, wherein each peripheral node is a start point of each directed edge associated with the respective peripheral node, each non-peripheral node is an end point of a directed edge associated with the respective non-peripheral node;
determining, by processing circuitry, layer scores of the nodes in the directed graph that is included in the flow direction feature information, the layer scores of the nodes being determined based on whether the directed graph includes a directed cycle, a layer score of a first one of the non-peripheral nodes being determined based on a plurality of lengths of paths from respective first peripheral nodes in the peripheral nodes to the first one of the non-peripheral nodes, wherein the paths have a same end point that is the first one of the non-peripheral nodes; and
determining the node types of the network nodes represented by the nodes in the directed network according to the layer scores of the determined nodes, wherein
the determination of at least one of the layer scores of the nodes in response to the directed graph including the directed cycle is different from the determination of the at least one of the layer scores of the nodes in response to the directed graph not including the directed cycle,
in response to the directed graph including the directed cycle of a plurality of the nodes, the layer scores of the plurality of the nodes are determined based on a number of the plurality of the nodes and a node number threshold, and
in response to the directed graph not including any directed cycle, the layer score of each remaining non-peripheral node of the nodes in the directed graph is determined based on lengths of paths from the peripheral nodes of the nodes in the directed graph to the respective remaining non-peripheral node, the non-peripheral nodes including the remaining non-peripheral nodes and the first one of the non-peripheral nodes.
|