通过对复杂网络一般模型的节点度序列{ k1，k2，…，kl } ( 1≤k1 ＜ k2… ＜ kl) 长度 l 的分析，得出了该模型度序列长度的一般特征，即 l 是 log2N( N 为网络节点数) 级别的，同 时采用基于 BA 模型的数据和真实复杂网络数据进行了实证分析，实证结果也证实了该 特征． 论文分析了大规模复杂网络中构建路由表的效率问题，同时构建了大量的基于度序 列的复杂网络的一般模型，通过实验对比了基于广度优先搜索( BFS) 算法的路由策略与 基于最大度( MD) 算法的路由策略的性能，实验结果表明，在复杂网络模型下，基于 MD 算 法的路由策略比基于 BFS 算法的路由策略有更好的性能．

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