The Research Of Node Importance Analysis In The Networks Topology

Internet is a window of the life. It is a great source of information, and it brings us a lot of convenience. Network seems an information network. And each device orderly receives and imparts information. In order to ensure efficient network operation, we need to deal with network failure timely. Important nodes need to be given more protection and support. Thus, it is very important to analysis the importance of network nodes.The existing node importance evaluation method based on removing node or node contraction, comparing the changes of the network performance to determine the importance of nodes, but it will lead to change or damage the structure of the network topology. A existing node importance evaluation algorithm based on improved topological potential pays attention to the resources control ability of the node in the whole network. However, the difference of magnitude between the two intrinsic properties (degree and betweenness) is too serious. In view of the above algorithms, a node importance evaluation algorithm which applies node-weighted methods is proposed. This algorithm is node importance estimation method based on entropy method. The weighted method consides comprehensively two factors, which can avoid the one-sided.The nodes importance of complex networks with edge-weighted is studied in this dissertation. It redefines the weighted nodes importance based on node contraction, which has strong practical significance.Markov chain model based on communication network topology is studied in this dissertation.. In the model, the sum of the probability of the shortest paths in which other nodes reach the node is the evaluation index of node importance. The algorithm is relatively low in complexity and more accurate which is suitable for wireless communication network.