东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2009, Vol. 30 ›› Issue (8): 1115-1118.DOI: -

• 论著 • 上一篇    下一篇

Internet路由级拓扑的可视化算法

张君;赵海;康敏;付大愚;   

  1. 东北大学医学影像计算教育部重点实验室;东北大学信息科学与工程学院;沈阳市气象局;
  • 收稿日期:2013-06-22 修回日期:2013-06-22 出版日期:2009-08-15 发布日期:2013-06-22
  • 通讯作者: Zhang, J.
  • 作者简介:-
  • 基金资助:
    教育部高等学校科技创新工程重大项目培育基金资助项目(708026)

On the algorithm of visualization of internet topology at router level

Zhang, Jun (1); Zhao, Hai (1); Kang, Min (3); Fu, Da-Yu (2)   

  1. (1) Key Laboratory of Medical Image Computing Ministry of Education, Northeastern University, Shenyang 110004, China; (2) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China; (3) Shenyang Meteorological Administration, Shenyang 110168, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2009-08-15 Published:2013-06-22
  • Contact: Zhang, J.
  • About author:-
  • Supported by:
    -

RichHTML

1

PDF (PC)

611

摘要： 针对Internet的可视化问题,分析了现有算法的不足.在此基础上,提出了一个新的算法:基于节点的核数,由内核至外核逐层演化的算法.该算法从中心点开始演化,首先找出与该点直接相连的点布置在其周围,布点的范围随着节点核数的减小而加大,而后再从各叶子节点开始,找出与其相连的节点布置在其周围.以CAIDA Riesling监测点在2007年5月的Internet路由级拓扑数据为例,描绘了Internet的可视化结果.从可视化结果可以看出:该算法在描绘Internet拓扑的层次性演化上是比较突出的,尤其是在内层,但是当演化到外层时,由于节点数目的急剧增加,使其层次性不再突出.

关键词: 复杂网络, 可视化算法, Internet路由级拓扑, 节点核数

Abstract: The visualization of Internet topology has been becoming a hot problem attracting the academic attention of complex network. The shortcomings of some existing algorithms were analyzed, then, a new algorithm was put forward by evolving the coreness of nodes from inside to outside. Starting the evolution from the center node, the algorithm finds out the nodes connected directly with the center node and arranges them around it, and the arranging range increases with decreasing coreness of nodes. Then, restarting the evolution from every leaf node, the nodes connected with the leaf node are found out and arranged around it. With the visualized data of the Internet topology at router level obtained from the Riesling monitor of CAIDA in May 2007 taken as example, the results show that the algorithm is beneficial to describe the hierarchies of Internet topology especially the inner cores. But, for the outer cores, its advantage is faint because of the fast increasing number of nodes.

中图分类号: