| Autor: |
Zhuo, Xinjian, Cao, Xiaojie |
| Zdroj: |
2012 3rd IEEE International Conference on Network Infrastructure & Digital Content; 1/ 1/2012, p294-298, 5p |
| Abstrakt: |
The paper builds a novel measurement model by abstract network flow monitoring into a minimum vertex cover problem. The algorithm we proposes firstly via giving the vertices with degree 1 special treatment (i.e., put the adjacent vertices into the vertex-cover set) and giving the definition of greedy-edge gains the vertex selection rules. Secondly, in order to optimize the result, the algorithm puts forward specific optimizing strategy by means of adjacency matrix. In other words, the selection of monitoring vertices of the algorithm is based on a specific optimizing strategy. Through some examples, it can be showed that our monitoring algorithm is more effective and better than the others over a wide range of network topologies. [ABSTRACT FROM PUBLISHER] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
