位置:成果数据库 > 期刊 > 期刊详情页
Evaluating the AS-level Internet models: Beyond topological characteristics
  • 期刊名称:Chinese Physics B (SCI Impact factor: 2.103)
  • 时间:0
  • 页码:256-260
  • 语言:英文
  • 分类:TP393.08[自动化与计算机技术—计算机应用技术;自动化与计算机技术—计算机科学与技术] TN92[电子电信—通信与信息系统;电子电信—信息与通信工程]
  • 作者机构:[1]Department of Automation, Sun Yat-Sen University, Guangzhou 510275, China
  • 相关基金:Project supported by the National Natural Science Foundation of China (Grant Nos. 60704045 and 60804012) and the Fundamental Research Funds for the Central Universities (Grant No. 09Lgpy57).
  • 相关项目:有限信道带宽限制下网络控制系统的优化控制及性能分析
作者: Fan Zhengping|
中文摘要:

A surge number of models has been proposed to model the Internet in the past decades.However,the issue on which models are better to model the Internet has still remained a problem.By analysing the evolving dynamics of the Internet,we suggest that at the autonomous system (AS) level,a suitable Internet model,should at least be heterogeneous and have a linearly growing mechanism.More importantly,we show that the roles of topological characteristics in evaluating and differentiating Internet models are apparently over-estimated from an engineering perspective.Also,we find that an assortative network is not necessarily more robust than a disassortative network and that a smaller average shortest path length does not necessarily mean a higher robustness,which is different from the previous observations.Our analytic results are helpful not only for the Internet,but also for other general complex networks.

英文摘要:

A surge number of models has been proposed to model the Internet in the past decades. However, the issue on which models are better to model the Internet has still remained a problem. By analysing the evolving dynamics of the Internet, we suggest that at the autonomous system (AS) level, a suitable Internet model, should at least be heterogeneous and have a linearly growing mechanism. More importantly, we show that the roles of topological characteristics in evaluating and differentiating Internet models are apparently over-estimated from an engineering perspective. Also, we find that an assortative network is not necessarily more robust than a disassortative network and that a smaller average shortest path length does not necessarily mean a higher robustness, which is different from the previous observations. Our analytic results are helpful not only for the Internet, but also for other general complex networks.

同期刊论文项目
期刊论文 26 会议论文 3 著作 1
同项目期刊论文