• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2014, Vol. 36 ›› Issue (04): 634-638.

• 论文 • 上一篇    下一篇

复杂网络匹配系数控制算法

关世杰   

  1. (沈阳工学院,辽宁 抚顺 113122)
  • 收稿日期:2013-04-03 修回日期:2013-06-22 出版日期:2014-04-25 发布日期:2014-04-25

On the algorithm of controlling of
matching coefficient of complex networks         

GUAN Shijie   

  1. (Shenyang Institute of Technology,Fushun 113122,China)
  • Received:2013-04-03 Revised:2013-06-22 Online:2014-04-25 Published:2014-04-25

摘要:

针对CAIDA提供的探测数据进行分析,得到互联网AS级宏观拓扑结构的随时间演化情况,在对匹配系数进行深入分析的基础上,提出了一种单调改变网络匹配系数的算法——边重连算法。该算法可以在两个方向上构造具有连续匹配系数的网络集合,选择向同配方向重连则可构建匹配系数渐进增大的连续匹配系数网络,选择向异配方向重连则可构建匹配系数不断减小的连续匹配系数网络,当边重连足够充分时可以得到具有极大匹配系数或极小匹配系数的网络。

关键词: 复杂网络, 互联网AS级, 网络拓扑, 度, CAIDA

Abstract:

According to the analysis of the detection data provided by CAIDA, the AS level topology of the internet developed by the time is found. On the basis of the deep analysis of the matching coefficient, an algorithm, named Edges Rewiring, is proposed, which can monotonously change the coefficient of the matched network. This algorithm can construct a network set with continuous matching coefficient in two directions. It can construct the crescent continuous net of matching algorithm network when choosing the same direction of reconnection, and it can construct the decreasing continuous matching algorithm when choosing the opposite direction of reconnection. The network with the maximal matching coefficient or with the minimal matching coefficient can be constructed when the number of edges rewiring is enough.

Key words: complex networks;ASlevel internet;network topology;degree;CAIDA