关键词: 复杂网络, 节点度序列, 路由策略

Abstract: By analyzing the length l of the vertex-degree sequence { k1，k2，…，kl} ( 1≤k1 ＜ k2 ＜ … ＜ kl ) of the complex network with general degree distribution，the general characteristic of the length of the vertex-degree sequence is obtained in this paper，which is that l is the order of log2N ( N is the number of network nodes) ． Meanwhile，on the basis of the real complex network datasets and the BA model datasets，the empirical analysis is performed，and the results also show this characteristic． Then，the efficiency in building routing tables in large-scale complex networks is analyzed，and many complex networks on the basis of vertex-degree sequence are constructed． Finally，through simulation experiments in complex networks，the performance of the routing strategy on the basis of the breadth first search algorithm ( BFS) is compared with that on the basis of the max degree algorithm ( MD) ． It is found that the latter is better than the former

Key words: complex network, vertex-degree sequence, routing strategy