| Internet路由级拓扑的可视化算法 |
| |
| 引用本文： | 张君,赵海,康敏,付大愚. Internet路由级拓扑的可视化算法[J]. 东北大学学报(自然科学版), 2009, 30(8): 1115-1118. DOI: - |
| |
| 作者姓名： | 张君 赵海 康敏 付大愚 |
| |
| 作者单位： | 东北大学,医学影像计算教育部重点实验室,辽宁,沈阳,110004;东北大学,信息科学与工程学院,辽宁,沈阳,110004;沈阳市气象局,辽宁,沈阳,110168;东北大学,信息科学与工程学院,辽宁,沈阳,110004 |
| |
| 基金项目： | 教育部高等学校科技创新工程重大项目培育基金 |
| |
| 摘 要： | 针对Internet的可视化问题,分析了现有算法的不足.在此基础上,提出了一个新的算法:基于节点的核数,由内核至外核逐层演化的算法.该算法从中心点开始演化,首先找出与该点直接相连的点布置在其周围,布点的范围随着节点核数的减小而加大,而后再从各叶子节点开始,找出与其相连的节点布置在其周围.以CAIDA Riesling监测点在2007年5月的Internet路由级拓扑数据为例,描绘了Internet的可视化结果.从可视化结果可以看出:该算法在描绘Internet拓扑的层次性演化上是比较突出的,尤其是在内层,但是当演化到外层时,由于节点数目的急剧增加,使其层次性不再突出.
|
| 关 键 词： | 复杂网络 可视化算法 Internet路由级拓扑 节点核数 |
On the Algorithm of Visualization of Internet Topology at Router Level |
| |
| ZHANG Jun,ZHAO Hai,KANG Min,FU Da-yu. On the Algorithm of Visualization of Internet Topology at Router Level[J]. Journal of Northeastern University(Natural Science), 2009, 30(8): 1115-1118. DOI: - |
| |
| Authors: | ZHANG Jun ZHAO Hai KANG Min FU Da-yu |
| |
| Affiliation: | ZHANG Jun1,2,ZHAO Hai1,KANG Min3,FU Da-yu2(1.Key Laboratory of Medical Image Computing,Ministry of Education,Northeastern University,Shenyang 110004,China,2.School of Information Science & Engineering,3.Shenyang Meteorological Administration,Shenyang 110168,China.) |
| |
| 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 e... |
| |
| Keywords: | complex network visualization algorithm Internet router-level topology coreness of nodes |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《东北大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《东北大学学报(自然科学版)》下载全文 |
|
