The analysis of algorithm for efficient network flow monitoring

Effective monitoring of network flow is a key enabling technology for networks and gains extensive attention of researcher. In this paper, we focus efficient monitoring by passive measurement for the network flow on reducing the generation overhead communication as much as possible. The problem of efficient monitoring for the network flow is regarded as the problem to find out the minimum flow partition marked set for a given graph, which is NP-hard by proof. Approximation algorithm to find out the minimum flow partition marked set is presented with approximation ratio. Simulation results indicate that our proposed algorithms dramatically reduce monitoring nodes compared to scenarios in which vertex cover is employed.