A Distributed Algorithm for Monitor-Nodes Selection in Net Traffic Measurement
Qinghua Zhang · Hu'nan Shifan Daxue xuebao. Ziran kexue ban · 2005
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.