网络流量测量中一种分布式有效测量点选择算法  

A Distributed Algorithm for Monitor-Nodes Selection in Net Traffic Measurement

作　　者：蒋红艳[1] 李闻[1] 林亚平[1] 张清华[1] 

机构地区：[1]湖南大学计算机与通信学院,中国长沙410082

出　　处：《湖南师范大学自然科学学报》2005年第3期18-21,共4页Journal of Natural Science of Hunan Normal University

基　　金：湖南省自然科学基金资助项目(03JJY3098)

摘　　要：提出了一种分布式求解弱顶点覆盖集的近似算法,用于网络流量有效测量点的选择.该算法不需要维护网络拓扑的全局信息.仿真结果表明,比较现有算法,新算法能找出更小的弱顶点覆盖集,具有更好的可扩展性.A distributed algorithm for finding the weak vertex cover of a graph is presented in this paper, which can be used for monitor-nodes selection in net traffic measurement. The algorithm does not require the information of the whole network topology. The simulation results show that the novel algorithm is more scalable than the traditional algorithms, and can find smaller weak vertex cover.

关 键 词：节点剩余度 分布式 弱顶点覆盖 流守恒 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]