基于节点度分层的路由器级拓扑布局算法  

Layout Algorithm of Router-level Topology Based on Hierarchy of Node Degree

作　　者：刘金明[1] 万明祥[2] 

机构地区：[1]南京邮电大学计算机学院,江苏南京210003 [2]南京邮电大学物联网学院,江苏南京210003

出　　处：《计算机技术与发展》2015年第1期100-106,共7页Computer Technology and Development

基　　金：江苏省科技支撑计划(BE2012849);江苏省研究生科研创新计划项目(CXZZ12_0483;CXLX12_0481)

摘　　要：在对Internet路由器级拓扑的可视化过程中,由于探测结果中节点数量众多和链路复杂,导致布局效果呈现主次不分、边交叉和布局效率低等问题。如何在保证全面展示拓扑中数据和提高布局效率的前提下呈现良好的布局效果是文中的研究重点。针对现有的布局算法都存在布局效果不佳和效率低等问题,提出一种改进的FR算法—DHL(Degree Hierarchical Layout)算法。首先,根据Internet路由器级拓扑中节点度分布的幂律性质将节点分为三类;接着对分类后的节点进行分层显示;最后根据层次的不同选取合理的初始温度和迭代次数。实验结果表明,文中算法能有效降低时间复杂度和边的交叉数,并使布局效果体现网络的层次性。In the visualization process of Internet topology at router-level,the effect on the layout appears orderless and the execution time is fairly long due to the large number of nodes and the complexity of links in the measurement results. It focuses on presenting good effect of layout under the premise of ensuring fully to demonstrate the topology data and improve the efficiency of layout. The execution time is fairly long and the layout don＇t reflect the hierarchy of the network in the existing layout algorithm. In this paper,present an improved FR algorithm called DHL （ Degree Hierarchical Layout） algorithm to solve the above problems. First,the nodes are divided into three catego-ries according to power-law distribution of the node degree in Internet topology at router level. Then the nodes in the network are separa-ted into multiple hierarchical layers after classification. Finally,the initial temperature and iterations are selected according to different lay-ers. The experimental results show that DHL algorithm can effectively reduce the execution time and the cross of links,layout is able to reflect the hierarchy of the network.

关 键 词：Internet路由器级拓扑 DHL算法 幂律性质 节点度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]