基于三元组信息的网络流量检测点选取算法

A Network Traffic Monitor-Node Selection Algorithm Based on Triple Tag

为了有效地选取网络流量检测点,根据流守恒假设,提出一种网络流量检测点选取算法.该算法将网络流量检测点选取问题抽象为图的弱顶点覆盖问题,使用三元组信息标记网络节点,通过比较和替换节点的三元组信息并根据最后的三元组信息,完成网络流量检测点的选取.仿真结果表明,新算法不需要了解网络拓扑的全局信息,能动态地排除无法部署的网络节点,有效地解决了网络流量检测点的选取问题.

Based on flow-conservation law, a network traffic monitor-node selection algorithm is proposed to effectively select the network traffic monitor-node. The problem of the monitor-node selection is regarded as a problem to find out the weak vertex cover of a graph. This algorithm marks all of the network nodes with the triple tags and recursively compares and replaces those triple tags. The network traffic monitor-nodes are selected by the final triple tags. Simulations show that the algorithm needs not to know the whole network topology. It can dynamically eliminate the unavailable network nodes to effectively solve the problem of the monitor-node selection.