Based On The K-The Shortest Path And Community Structure Of The Network Transmission Performance Research

Complex systems are often formed by the interaction between many individual, thus the system can abstract into network which were studied. To describe the structure of the system and understand the function and nature of the system by using the network science of theory, thus obtains the rules then apply it is persistent goal of a complex system research. After abstracting complex systems become to network which is studied, the system operation state will run into the problem about network operation.This paper to investigate the utilization of nodes which is in the network and the network transmission performance, under the background of the theory of network science, in order to conduct the thorough research about urban road network and the community structure of network, build the triangle network and community structure of network model, using the K-the shortest path algorithm to analysis the use of nodes and network transmission performance in two kinds of network model, put forward the appropriate values of K which can effectively increase the utilization rate of nodes and improve the network transmission performance.Because the triangle network is similar to the characteristics of neat in the urban transportation network, build a triangular network model as the research object. K-the shortest path algorithm is used to analyze the triangle network travel OD simulation operation (traffic matrix), analyzes the flow distribution of network nodes, through the path length and the gini coefficient to judge the utilization of node and network transmission performance, put forward to increase the number of path travel strategy can effectively increase the traffic network throughput.Because the vast majority of community detection algorithm’s time complexity is square, and these detection algorithms need to determine the number of community structure in advance, proposing a similarity using node and label delivery mechanism of community detection algorithms. Design ideas of the algorithm is to get the nodes similarity by using the adjacency matrix of the node, and then through the label delivery mechanism to adjust node similarity, finally divide the nodes into different communities by the nodes similarity after adjustment. Compared with other community detection algorithms, this algorithm does not need to determine the total number of community in advance, and the time complexity and corporate division effect comprehensive performance is better.As simulated traffic network model, build a network model with the community structure as the research object for the simulation, using the K-the shortest path algorithms to simulation the travel OD in model, analysis of network node flow distribution, judging the utilization about nodes and the network transmission performance, the results show that the appropriate values of K can effectively improve the network throughput.