网络流量有效监测点的设置模型及求解算法研究-电子与信息学报.PDFVIP

第28 卷第4 期 电 子 与 信 息 学 报 Vol.28No.4 2006 年4 月 Journal of Electronics Information Technology Apr. 2006 网络流量有效监测点的设置模型及求解算法研究 蒋红艳 林亚平 黄生叶 (湖南大学计算机与通信学院 长沙 410082) 摘　要 网络流量监测点问题可以抽象为图的最小弱顶点覆盖问题，而求解最小弱顶点覆盖问题是一个NP 难题。该文利用图论 中关联矩阵的概念，提出了一个近似算法, 并分析了算法的复杂性。在此基础上将该算法拓展到顶点加权情况下图的弱顶点覆盖 问题。理论分析和仿真实验表明，比较现有的算法，新的算法能够发现更小的弱顶点覆盖集，且具有更好的可扩展性。 关键词 图论，弱顶点覆盖，顶点加权，流守恒，NP 难题，关联矩阵 中图分类号：TP393.06, O157.9 文献标识码：A 文章编号：1009-5896(2006)04-0753-04 Model and Algorithm Research for Seeking Efficient Monitor-Nodes Measuring Network Traffic Jiang Hong-yan Lin Ya-ping Huang Sheng-ye (College of Computer and Communication, Hunan University , Changsha 410082, China ) Abstract The problem of seeking monitor-nodes for measuring the network traffic 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 in this paper based on the concept of incidence matrix in Graph. Also the complexity of the algorithm is analyzed. Furthermore, the algorithm is expanded to seek the minimum weak vertex cover for a graph that has weights on the nodes. The theoretical analysis and the simulation results show that the novel algorithm is more scalable than the traditional algorithms, and can find smaller weak vertex cover. Key words Graph, Weak vertex cover, Nodes with weights, Flow conservation, NP-hard, Incidence matrix 1 引言 2 预备知识 随着Internet应用的增长，网管系统越来越注重于应用服 在网络中