Key Node Recognition Based on Community Discovery

Xinran Zhu, W. Liu, Zeyu Gu, Zihao Liu
{"title":"Key Node Recognition Based on Community Discovery","authors":"Xinran Zhu, W. Liu, Zeyu Gu, Zihao Liu","doi":"10.1145/3603781.3603935","DOIUrl":null,"url":null,"abstract":"The network topology is difficult to reflect the service relationship between the device nodes, and cannot provide critical service nodes for DDos attacks. This paper introduces a Key Node recognition algorithm based on community discovery. The algorithm judges the ownership of the service community through the service mapping relationship between network nodes, and finds the key nodes of network services and the subordinate relationship between nodes. The algorithm finds the network core service node through the dual-connected core graph and node mapping degree. Then it expands the community according to the mapping relationship, and divide the boundary nodes into the community. In simulation experiments, the effectiveness of the algorithm is demonstrated by simulating denial of service attacks, which can provide correlation between node services.","PeriodicalId":391180,"journal":{"name":"Proceedings of the 2023 4th International Conference on Computing, Networks and Internet of Things","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2023 4th International Conference on Computing, Networks and Internet of Things","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3603781.3603935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The network topology is difficult to reflect the service relationship between the device nodes, and cannot provide critical service nodes for DDos attacks. This paper introduces a Key Node recognition algorithm based on community discovery. The algorithm judges the ownership of the service community through the service mapping relationship between network nodes, and finds the key nodes of network services and the subordinate relationship between nodes. The algorithm finds the network core service node through the dual-connected core graph and node mapping degree. Then it expands the community according to the mapping relationship, and divide the boundary nodes into the community. In simulation experiments, the effectiveness of the algorithm is demonstrated by simulating denial of service attacks, which can provide correlation between node services.
基于社区发现的关键节点识别
这种网络拓扑结构难以反映设备节点间的业务关系,无法为DDos攻击提供关键的业务节点。介绍了一种基于社区发现的关键节点识别算法。该算法通过网络节点之间的服务映射关系判断服务社区的归属,找到网络服务的关键节点和节点之间的从属关系。该算法通过双连通核心图和节点映射度找到网络核心业务节点。然后根据映射关系对社区进行扩展,并将边界节点划分为社区。在仿真实验中,通过模拟拒绝服务攻击验证了该算法的有效性,该算法可以提供节点服务之间的相关性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信