Efficiently passive monitoring flow bandwidth

Authors:
Zhiping Cai;Jianping Yin;Fang Liu;Xianghui Liu;Shaohe Lv
Affiliations:
School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China
Venue:
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Year:
2005

Citing 4
Cited 0

Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Approximation algorithm for weighted weak vertex cover

Journal of Computer Science and Technology
Approximation algorithms for the loop cutset problem

UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using the flow-conservation law, we could reduce the number of activated monitor agents used to monitor link bandwidth usage. In this paper, we address the problem of efficiently passive monitoring flow bandwidth based on flow-conservation, which could be reduced to weak vertex cover problem. And the weak vertex cover problem is NP-hard. We give an approximation algorithm with approximation ratio 2 to solve the problem. The effectiveness of our monitoring algorithm is validated by simulations evaluation over a wide range of network topologies.