An approximation algorithm for weak vertex cover problem in network management

Authors:
Zhiping Cai;Jianping Yin;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
Venue:
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Year:
2005

Citing 9
Cited 0

End-to-end packet delay and loss behavior in the internet

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Cisco IOS 12.0 Switching Services

Cisco IOS 12.0 Switching Services
SNMP,SNMPV2,Snmpv3,and RMON 1 and 2

SNMP,SNMPV2,Snmpv3,and RMON 1 and 2
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
Using passive measuring to calibrate active measuring latency

ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Passive calibration of active measuring latency

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
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

Link-bandwidth utilization and flow information are obviously critical for numerous network management tasks. The problem of efficiently monitoring the network flowing based on flow-conservation could be reduced to Weak Vertex Cover problem, which is NP-hard. In this paper, using the primal-dual method, we give an approximation algorithm with approximation ratio 2 to solve the problem. It is a near-optimal algorithm as it is very difficult to get an approximation algorithm with approximation ratio lower than 2 for Weak Vertex Cover problem. The effectiveness of our monitoring algorithm is validated by simulations evaluation over a wide range of network topologies. The practices indicate that our work is valuable to solve Weak Vertex Cover problem and its application in network management.