Efficiently monitoring link bandwidth in IP networks

Zhiping Cai, Jianping Yin, Fang Cherry Liu, Xianghui Liu, Shaohe Lv · GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. · 2005

Link bandwidth utilization is obviously critical for numerous network management tasks. Using the flow-conservation law, we could reduce the number of activated monitor agents. The problem of efficiently monitoring link-bandwidth based on flow-conservation law could be reduced to weak vertex cover problem, which is NP-hard. In this paper, we demonstrate an approximation preserving reduction from the vertex cover problem to weak vertex cover problem. Due to this reduction, it follows that it is very difficult to get an approximation algorithm with approximation ratio lower than 2 for weak vertex cover problem. Using the primal-dual method, 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. We also demonstrate the problem of weak vertex cover with blackout vertices could be reduce to weak vertex cover problem. Hence we could use the approximation algorithms for weak vertex cover problem to solve the problem of weak vertex cover with blackout vertices.

Read the paper · More papers on PaperTik