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

On the Algorithm of Visualization of Internet Topology at Router Level

作　　者：张君[1,2] 赵海[1,2] 康敏[3] 付大愚[2] 

机构地区：[1]东北大学医学影像计算教育部重点实验室,辽宁沈阳110004 [2]东北大学信息科学与工程学院,辽宁沈阳110004 [3]沈阳市气象局,辽宁沈阳110168

出　　处：《东北大学学报（自然科学版）》2009年第8期1115-1118,共4页Journal of Northeastern University(Natural Science)

基　　金：教育部高等学校科技创新工程重大项目培育基金资助项目(708026)

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

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

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TP393.03[自动化与计算机技术—计算机科学与技术]