Analysis Of Topological Structures And Research On Routing Strategies Of Complex Networks

The purpose of the study of topological structure is to understand the dynamic behavior of complex network,and it's the foundation of other research on complex network. The ability of data transmission of communication network is affected by topological structure and routing strategy. Good routing strategy can make full use of the information of network topology, decentralize congestion, and improve the network transmission capacity. This paper took the ISP network as the research object of the complex network, analyzed the topology structure of the ISP network, and also studied the routing strategy on complex network.The main contents and contributions of this paper are as follows:In this paper, a network topology detection system was constructed,and the network topology of IP network was reduced. Then, this paper analysed the feature of the IP network of ISP, and found that the IP network follows the power distribution and the power exponent ? = -2.65. The IP network has the characteristics of scale free that few nodes has big degree and betweenness. Meanwhile, this paper analysed the probe path, and found the suspected core network of the ISP network, the structure of the IP network and the pattern of flow direction of data packets.On the basis of the analysis of the network topology, the function importance of node was defined, which expressed the effect of the node to complete a specific function for the network. A scoring model was proposed which was aimed at the ISP network. The score of node is indicated the function importance. It was found that there wasn't significantly related between the function importance and the topology importance of nodes, through the comparison among the score, the degree centrality, the betweenness centrality and the core number.In order to avoid network congestion and improve network transmission capacity and performance. In this paper, a local information increment was defined which could make the data packet meet more new node, and the local information of vi to vj is the number of node which is the adjacency node of vj,and isn't the adjacency node of vi. A routing strategy based on local information increment and buffer queue information was proposed. The simulation result showed that the new strategy compared with the routing strategy based on degree information not only balanced the network traffic load but also made the best use of the transmission capacity of the node having a bigger local information increment, avoided the network congestion and reduced the length of the data packet transmission path.