A method of fast locating the key nodes based on the distribution law of node's propagation domain

Xiaolin Zhao, Meijing Wu, Qi Zhang, Jingfeng Xue, Yiman Zhang

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

In this paper, we select the key nodes from the software network by selecting the propagation domain as the standard and propose a method of fast locating key nodes based on the distribution law of node's propagation domain. Firstly, a reasonable sample node is used to quickly obtain the critical propagation domain threshold as a screening criterion. And filtering the key nodes with this threshold can significantly reduce the total traversal workload. In order to further reduce workload, this paper proposes a filtering method of critical nodes that threshold is based on the number of packets that the nodes can affect. After a number of experiments, the result shows that the proposed method can effectively reduce the traversal workload of locating key nodes.

源语言英语
主期刊名Proceedings - 2018 IEEE 3rd International Conference on Data Science in Cyberspace, DSC 2018
出版商Institute of Electrical and Electronics Engineers Inc.
902-909
页数8
ISBN(电子版)9781538642108
DOI
出版状态已出版 - 16 7月 2018
活动3rd IEEE International Conference on Data Science in Cyberspace, DSC 2018 - Guangzhou, Guangdong, 中国
期限: 18 6月 201821 6月 2018

出版系列

姓名Proceedings - 2018 IEEE 3rd International Conference on Data Science in Cyberspace, DSC 2018

会议

会议3rd IEEE International Conference on Data Science in Cyberspace, DSC 2018
国家/地区中国
Guangzhou, Guangdong
时期18/06/1821/06/18

指纹

探究 'A method of fast locating the key nodes based on the distribution law of node's propagation domain' 的科研主题。它们共同构成独一无二的指纹。

引用此