Computer Science & Technology

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

Expand
  • 1. School of Computer Science and Engineering,South China University of Technology 2. School of Software Engineering,South China University of Technology 3. School of Mathmatics and Informatics,South China University of Agriculture
熊云艳( 1976-) ,女,博士生,副教授,主要从事复杂网络、数据中心网络等的研究

Received date: 2015-04-15

  Revised date: 2015-07-22

  Online published: 2015-10-01

Supported by

Supported by the National Natural Science Foundation of China( 61170313)

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

Cite this article

Xiong Yun-yan Xiao Wen-jun Mao Yi-jun Lai Zheng-wen Han Dong . A Degree Sequence-Based Complex Network Model and Its Routing Strategy Analysis[J]. Journal of South China University of Technology(Natural Science), 2015 , 43(11) : 30 -34 . DOI: 10.3969/j.issn.1000-565X.2015.11.005

Outlines

/