Title :
Research based on the specific optimizing strategy for network flow monitoring
Author :
Xinjian Zhuo ; Xiaojie Cao
Author_Institution :
Beijing Univ. of Posts & Telecommun., Beijing, China
Abstract :
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.
Keywords :
greedy algorithms; matrix algebra; optimisation; telecommunication network topology; abstract network flow monitoring optimization strategy; adjacency matrix; greedy-edge gains; measurement model; minimum vertex cover problem; monitoring vertices selection; network topology; vertex selection rules; Abstracts; Algorithm design and analysis; Approximation algorithms; Approximation methods; Bandwidth; Educational institutions; Monitoring; Cover set; Degree adjacent matrix; Greedy-edge; Subgraph;
Conference_Titel :
Network Infrastructure and Digital Content (IC-NIDC), 2012 3rd IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4673-2201-0
DOI :
10.1109/ICNIDC.2012.6418763