一种新的网络拓扑可视化算法

Yong Guozheng, L. Yuliang, Chen Huixian
{"title":"一种新的网络拓扑可视化算法","authors":"Yong Guozheng, L. Yuliang, Chen Huixian","doi":"10.1109/IMCCC.2011.99","DOIUrl":null,"url":null,"abstract":"This paper devotes into the technology of network topology visualization, introduces several current network topology visualization algorithms firstly. Then aimed to the display problem for large size network, puts forward a new network topology visualization algorithm which contains two policies: one is the layer model determined by network characters, another is the dynamic layout process by force-directed. After the analysis of algorithm efficiency, we implement it in our visualization tool. In our experiment, it can effectively and clearly display moderate computer network topology. We also design a valid route visualization finding method based on this displayed network topology.","PeriodicalId":446508,"journal":{"name":"2011 First International Conference on Instrumentation, Measurement, Computer, Communication and Control","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A New Network Topology Visualization Algorithm\",\"authors\":\"Yong Guozheng, L. Yuliang, Chen Huixian\",\"doi\":\"10.1109/IMCCC.2011.99\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper devotes into the technology of network topology visualization, introduces several current network topology visualization algorithms firstly. Then aimed to the display problem for large size network, puts forward a new network topology visualization algorithm which contains two policies: one is the layer model determined by network characters, another is the dynamic layout process by force-directed. After the analysis of algorithm efficiency, we implement it in our visualization tool. In our experiment, it can effectively and clearly display moderate computer network topology. We also design a valid route visualization finding method based on this displayed network topology.\",\"PeriodicalId\":446508,\"journal\":{\"name\":\"2011 First International Conference on Instrumentation, Measurement, Computer, Communication and Control\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 First International Conference on Instrumentation, Measurement, Computer, Communication and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMCCC.2011.99\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 First International Conference on Instrumentation, Measurement, Computer, Communication and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMCCC.2011.99","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文研究了网络拓扑可视化技术,首先介绍了目前几种网络拓扑可视化算法。然后针对大型网络的显示问题,提出了一种新的网络拓扑可视化算法,该算法包含两种策略:一种是由网络特征决定的层模型,另一种是由力导向的动态布局过程。在对算法效率进行分析后,我们在自己的可视化工具中实现了该算法。在我们的实验中,它可以有效、清晰地显示适度的计算机网络拓扑结构。在此基础上设计了一种有效的路由可视化查找方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New Network Topology Visualization Algorithm
This paper devotes into the technology of network topology visualization, introduces several current network topology visualization algorithms firstly. Then aimed to the display problem for large size network, puts forward a new network topology visualization algorithm which contains two policies: one is the layer model determined by network characters, another is the dynamic layout process by force-directed. After the analysis of algorithm efficiency, we implement it in our visualization tool. In our experiment, it can effectively and clearly display moderate computer network topology. We also design a valid route visualization finding method based on this displayed network topology.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信