Optimization of traffic filtering in virtual networks based on solving the minimum vertex cover problem
Stanislav Motsnyi · 2016
In this paper an approach to optimizing traffic filtering process in virtual networks is presented. The main idea is to solve the minimum vertex cover problem and apply the filtering procedures only to the obtained subset of vertices that represent telecommunication nodes. An algorithm for solving the minimum vertex cover problem with reduced time complexity is given. Different groups of tests were done using specifically developed software package. According to the experiment results, the proposed method can significantly improve the performance of the traffic analysis and monitoring in virtual networks.