Primal Dual Algorithm for Efficient SNMP Agent Deployment in IP Network
The quickly growth of Internet and applications generated massive data and it become more and more important for bandwidth management.Simple SNMP prototal is usually employed to perform traffic information collected.In this paper, we addressed the problem of efficiently monitoring bandwidth utilization through deploying SNMP agents strategically.Firstly we convert the problem into finding out the minimum weak vertex cover set, which has been proved as NP-Complete probelom.And then we analyzed the constraints of weak vertex set and proposed the integer programming formulation for the problem, and we employed the primal dual approximation algorithm to solve the problems.Finally, we performed some simulation experiments based on our proposed methds, and the comparsion results with other methods show the effciency of our proposed methods.
SNMP Agent Deployment Weak Vertex Cover Primal Dual Algorithm
Jian Zhang Yah Tong Tao Qin Mingdi Xu
System Research Department, Wuhan Digital Engineering Institute, Wuhan, China MoE Key Lab for Intelligent Networks and Network Security, Xian Jiaotong University, Xian China System Software Department, Wuhan Digital Engineering Institute, Wuhan, China
国际会议
三亚
英文
440-447
2015-12-26（万方平台首次上网日期，不代表论文的发表时间）