摘要
给出了一种快速且对网络产生负载较小的网络拓扑发现算法,特点是利用数据库存储数据,可以方便地对数据进行检索和处理。基于H3拓扑可视化原理对数据进行预处理,得到需要的输入文件。最后利用双曲空间对网络拓扑进行显示。测试结果表明,该方法可以很好地对网络拓扑进行可视化,显示效果美观。
A network topology discovery algorithm was given which had the characteristic of rapid and less extra traffic. The path data were stored by database to facilitate the retrieval and processing of data. Then based on the principle of H3 visualization, the source data was processed to get the needed input file. Finally the network topology was displayed in the hyperbolic space. The test results show that the method is suitable for the network topology visualization, and it can display the network topology beautifully.
出处
《电信科学》
北大核心
2014年第5期126-130,共5页
Telecommunications Science
关键词
网络拓扑发现
拓扑可视化
H3可视化
双曲空间
network topology discovery
topology visualization
H3 visualization
hyperbolic space
