Knowledge Network Node

An Algorithm for Seeking Monitor-Nodes Measuring Network Traffic Based on Adjacency Matrix

Shi Henghua~1,He Jingsha~2,and Xu Xin~1 1(College of Computer Science,Beijing University of Technology,Beijing 100124) 2(School of Software Engineering,Beijing University of Technology,Beijing 100124)

Abstract: To research the efficient measurement of the network traffic,considering the equation of the flow conservation,seeking monitor-nodes is regarded as the problem of finding out the minimum weak vertex cover of a graph,which is NP-hard.An approximation algorithm is proposed based on the concept of adjacent matrix in graph,and the algorithm finds out the minimum weak vertex cover set by repeatedly deleting the rows and columns of the nodes whose line element amount is not more than one.By recursivel... More
Keywords：

weak vertex; NP-hard; flow conservation; approximation algorithm; adjacency matrix;

Conference Name：

第八届全国信息隐藏与多媒体安全学术大会湖南省计算机学会第十一届学术年会

Conference Time：

2009-03-28

Conference Place：

中国湖南长沙

  • Series：

    (I) Electronic Technology ＆ Information Science

  • Subject：

    Internet Technology

  • Classification Code：

    TP393.06

Download the mobile appuse the app to scan this coderead the article.

Tips: Please download CAJViewer to view CAJ format full text.

Download: 64 Page: 381-385 Pagecount: 5 Size: 214k

Related Literature
  • Similar Article
  • Reader Recommendation
  • Associated Author