基于度序列的复杂网络模型及其路由策略分析  

A Degree Sequence-Based Complex Network Model and Its Routing Strategy Analysis

作　　者：熊云艳[1] 肖文俊[2] 毛宜军[3] 赖正文[1] 韩冬[1] 

机构地区：[1]华南理工大学计算机科学与工程学院,广东广州510640 [2]华南理工大学软件学院,广东广州510006 [3]华南农业大学数学与信息学院,广东广州510642

出　　处：《华南理工大学学报（自然科学版）》2015年第11期30-34,共5页Journal of South China University of Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(61170313)~~

摘　　要：通过对复杂网络一般模型的节点度序列{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.

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

分 类 号：TP393.0[自动化与计算机技术—计算机应用技术]