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

doi:10.1109/DSC.2018.00144

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

School of Computer Science and Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	English
Title of host publication	Proceedings - 2018 IEEE 3rd International Conference on Data Science in Cyberspace, DSC 2018
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	902-909
Number of pages	8
ISBN (Electronic)	9781538642108
DOIs	https://doi.org/10.1109/DSC.2018.00144
Publication status	Published - 16 Jul 2018
Event	3rd IEEE International Conference on Data Science in Cyberspace, DSC 2018 - Guangzhou, Guangdong, China Duration: 18 Jun 2018 → 21 Jun 2018

Publication series

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

Conference

Conference	3rd IEEE International Conference on Data Science in Cyberspace, DSC 2018
Country/Territory	China
City	Guangzhou, Guangdong
Period	18/06/18 → 21/06/18

Keywords

Key nodes
NODE'S propagation domain
The number of packages that the node can affect

Access to Document

10.1109/DSC.2018.00144

Cite this

Zhao, X., Wu, M., Zhang, Q., Xue, J., & Zhang, Y. (2018). A method of fast locating the key nodes based on the distribution law of node's propagation domain. In Proceedings - 2018 IEEE 3rd International Conference on Data Science in Cyberspace, DSC 2018 (pp. 902-909). Article 8411965 (Proceedings - 2018 IEEE 3rd International Conference on Data Science in Cyberspace, DSC 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/DSC.2018.00144

Zhao, Xiaolin ; Wu, Meijing ; Zhang, Qi et al. / A method of fast locating the key nodes based on the distribution law of node's propagation domain. Proceedings - 2018 IEEE 3rd International Conference on Data Science in Cyberspace, DSC 2018. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 902-909 (Proceedings - 2018 IEEE 3rd International Conference on Data Science in Cyberspace, DSC 2018).

@inproceedings{c95d413a9eb24758ba0aace567983028,

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

abstract = "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.",

keywords = "Key nodes, NODE'S propagation domain, The number of packages that the node can affect",

author = "Xiaolin Zhao and Meijing Wu and Qi Zhang and Jingfeng Xue and Yiman Zhang",

note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 3rd IEEE International Conference on Data Science in Cyberspace, DSC 2018 ; Conference date: 18-06-2018 Through 21-06-2018",

year = "2018",

month = jul,

day = "16",

doi = "10.1109/DSC.2018.00144",

language = "English",

series = "Proceedings - 2018 IEEE 3rd International Conference on Data Science in Cyberspace, DSC 2018",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "902--909",

booktitle = "Proceedings - 2018 IEEE 3rd International Conference on Data Science in Cyberspace, DSC 2018",

address = "United States",

}

Zhao, X, Wu, M, Zhang, Q, Xue, J & Zhang, Y 2018, A method of fast locating the key nodes based on the distribution law of node's propagation domain. in Proceedings - 2018 IEEE 3rd International Conference on Data Science in Cyberspace, DSC 2018., 8411965, Proceedings - 2018 IEEE 3rd International Conference on Data Science in Cyberspace, DSC 2018, Institute of Electrical and Electronics Engineers Inc., pp. 902-909, 3rd IEEE International Conference on Data Science in Cyberspace, DSC 2018, Guangzhou, Guangdong, China, 18/06/18. https://doi.org/10.1109/DSC.2018.00144

A method of fast locating the key nodes based on the distribution law of node's propagation domain. / Zhao, Xiaolin; Wu, Meijing; Zhang, Qi et al.
Proceedings - 2018 IEEE 3rd International Conference on Data Science in Cyberspace, DSC 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 902-909 8411965 (Proceedings - 2018 IEEE 3rd International Conference on Data Science in Cyberspace, DSC 2018).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Zhao, Xiaolin

AU - Wu, Meijing

AU - Zhang, Qi

AU - Xue, Jingfeng

AU - Zhang, Yiman

PY - 2018/7/16

Y1 - 2018/7/16

N2 - 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.

AB - 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.

KW - Key nodes

KW - NODE'S propagation domain

KW - The number of packages that the node can affect

UR - http://www.scopus.com/inward/record.url?scp=85051031075&partnerID=8YFLogxK

U2 - 10.1109/DSC.2018.00144

DO - 10.1109/DSC.2018.00144

M3 - Conference contribution

AN - SCOPUS:85051031075

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

SP - 902

EP - 909

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

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 3rd IEEE International Conference on Data Science in Cyberspace, DSC 2018

Y2 - 18 June 2018 through 21 June 2018

ER -

Zhao X, Wu M, Zhang Q, Xue J, Zhang Y. A method of fast locating the key nodes based on the distribution law of node's propagation domain. In Proceedings - 2018 IEEE 3rd International Conference on Data Science in Cyberspace, DSC 2018. Institute of Electrical and Electronics Engineers Inc. 2018. p. 902-909. 8411965. (Proceedings - 2018 IEEE 3rd International Conference on Data Science in Cyberspace, DSC 2018). doi: 10.1109/DSC.2018.00144

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

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this