Displaying network topology by hierarchical layout with interest level

Yuichi Sakuraba
{"title":"Displaying network topology by hierarchical layout with interest level","authors":"Yuichi Sakuraba","doi":"10.1109/APNOMS.2012.6356095","DOIUrl":null,"url":null,"abstract":"In a network management with huge numbers of nodes, network topology is usually displayed in a manner that sub-network is organized as a group and each group is displayed respectively by itself. However, we can't see nodes in plural groups and connections between them simultaneously in this model. To solve the problem, we proposed a hierarchical layout model that expands groups on demand in the same screen keeping connections between nodes in a previous paper [1]. However, when many groups are expanded, they may not fit within the display area. Therefore, we introduce expanding factor by the interest level for more efficient display of the network in this paper. According to the interest level factor, the groups with high interest level are displayed widely, and the groups with low interest level in displayed narrowly or iconized. We model the interest level mathematically, and discuss the model efficacy.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APNOMS.2012.6356095","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In a network management with huge numbers of nodes, network topology is usually displayed in a manner that sub-network is organized as a group and each group is displayed respectively by itself. However, we can't see nodes in plural groups and connections between them simultaneously in this model. To solve the problem, we proposed a hierarchical layout model that expands groups on demand in the same screen keeping connections between nodes in a previous paper [1]. However, when many groups are expanded, they may not fit within the display area. Therefore, we introduce expanding factor by the interest level for more efficient display of the network in this paper. According to the interest level factor, the groups with high interest level are displayed widely, and the groups with low interest level in displayed narrowly or iconized. We model the interest level mathematically, and discuss the model efficacy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过带兴趣级别的分层布局显示网络拓扑
在节点数量庞大的网络管理中,网络拓扑的显示方式通常是将子网组织成一组,每一组各自显示。然而,在这个模型中,我们不能同时看到多个组中的节点和它们之间的连接。为了解决这个问题,我们在之前的论文[1]中提出了一种分层布局模型,在同一屏幕上按需扩展分组,保持节点之间的连接。然而,当许多组被展开时,它们可能不适合显示区域。因此,为了更有效地展示网络,本文引入了兴趣水平扩展因子。根据兴趣水平因素,兴趣水平高的群体被广泛展示,而兴趣水平低的群体则被狭隘地或形象地展示。我们建立了兴趣水平的数学模型,并讨论了模型的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Misconfiguration detection for cloud datacenters using decision tree analysis Design of the mitigation information network in urban area Flattening and preferential attachment in the internet evolution OPERAS': Generating and improving network operational workflows on-the-fly Data allocation method considering server performance and data access frequency with consistent hashing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1