{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:16:18Z","timestamp":1775229378649,"version":"3.50.1"},"reference-count":32,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:00:00Z","timestamp":1635811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Inter-domain routing systems is an important complex network in the Internet. Research on the vulnerability of inter-domain routing network nodes is of great support to the stable operation of the Internet. For the problem of node vulnerability, we proposed a method for identifying key nodes in inter-domain routing systems based on cascading failures (IKN-CF). Firstly, we analyzed the topology of inter-domain routing network and proposed an optimal valid path discovery algorithm considering business relationships. Then, the reason and propagation mechanism of cascading failure in the inter-domain routing network were analyzed, and we proposed two cascading indicators, which can approximate the impact of node failure on the network. After that, we established a key node identification model based on improved entropy weight TOPSIS (EWT), and the key node sequence in the network can be obtained through EWT calculation. We compared the existing three methods in two real inter-domain routing networks. The results indicate that the ranking results of IKN-CF are high accuracy, strong stability, and wide applicability. The accuracy of the top 100 nodes of the ranking result can reach 83.6%, which is at least 12.8% higher than the average accuracy of the existing three methods.<\/jats:p>","DOI":"10.3390\/e23111456","type":"journal-article","created":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T22:17:23Z","timestamp":1635891443000},"page":"1456","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["IKN-CF: An Approach to Identify Key Nodes in Inter-Domain Routing Systems Based on Cascading Failures"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4298-9681","authenticated-orcid":false,"given":"Wendian","family":"Zhao","sequence":"first","affiliation":[{"name":"College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China"},{"name":"Anhui Province Key Laboratory of Cyberspace Security Situation Awareness and Evaluation, Hefei 230037, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2055-3799","authenticated-orcid":false,"given":"Yongjie","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China"},{"name":"Anhui Province Key Laboratory of Cyberspace Security Situation Awareness and Evaluation, Hefei 230037, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinli","family":"Xiong","sequence":"additional","affiliation":[{"name":"College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China"},{"name":"Anhui Province Key Laboratory of Cyberspace Security Situation Awareness and Evaluation, Hefei 230037, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiazhen","family":"Zhao","sequence":"additional","affiliation":[{"name":"College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China"},{"name":"Anhui Province Key Laboratory of Cyberspace Security Situation Awareness and Evaluation, Hefei 230037, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,11,2]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1109\/90.974523","article-title":"Stable Internet routing without global coordination","volume":"9","author":"Gao","year":"2001","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/JPROC.2009.2034031","article-title":"A survey of BGP security issues and solutions","volume":"98","author":"Butler","year":"2009","journal-title":"Proc. IEEE"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.3724\/SP.J.1001.2013.04346","article-title":"Study on BGP Security: Study on BGP Security","volume":"24","author":"Li","year":"2014","journal-title":"J. Softw."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/2668152.2668966","article-title":"Why Is It Taking So Long to Secure Internet Routing?","volume":"12","author":"Goldberg","year":"2014","journal-title":"Queue"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Vervier, P.A., Thonnard, O., and Dacier, M. (2015, January 8\u201311). Mind Your Blocks: On the Stealthiness of Malicious BGP Hijacks. Proceedings of the Network and Distributed System Security Symposium (NDSS 2015), San Diego, CA, USA.","DOI":"10.14722\/ndss.2015.23035"},{"key":"ref_6","first-page":"1","article-title":"BGP Security Vulnerabilities Analysis","volume":"4272","author":"Murphy","year":"2006","journal-title":"RFC"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Schuchard, M., Mohaisen, A., Foo Kune, D., Hopper, N., Kim, Y., and Vasserman, E.Y. (2010, January 4\u20138). Losing control of the internet: Using the data plane to attack the control plane. Proceedings of the 17th ACM Conference on Computer and Communications Security, Chicago, IL, USA.","DOI":"10.1145\/1866307.1866411"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.4304\/jcm.5.1.13-22","article-title":"On Evaluating BGP Routing Stress Attack","volume":"5","author":"Deng","year":"2010","journal-title":"J. Commun."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1002\/dac.2748","article-title":"The new threat to internet: DNP attack with the attacking flows strategizing technology","volume":"28","author":"Li","year":"2015","journal-title":"Int. J. Commun. Syst."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","article-title":"Factoring and weighting approaches to status scores and clique identification","volume":"2","author":"Bonacich","year":"1972","journal-title":"J. Math. Sociol."},{"key":"ref_11","first-page":"63","article-title":"A set of measures of centrality based upon betweenness","volume":"4","author":"Freeman","year":"1977","journal-title":"Sociometry"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2018small-world\u2019 networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Zhao, W., Wang, Y., Xiong, X., and Yang, F. (2020, January 11\u201314). Finding Key Nodes in Complex Networks: An Edge and Local Partition Approach. Proceedings of the 2020 IEEE 6th International Conference on Computer and Communications (ICCC), Chengdu, China.","DOI":"10.1109\/ICCC51575.2020.9345096"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.physa.2016.02.049","article-title":"Evaluating the importance of nodes in complex networks","volume":"452","author":"Liu","year":"2016","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"28947","DOI":"10.1109\/ACCESS.2020.2972107","article-title":"Efficient Algorithm for the Identification of Node Significance in Complex Network","volume":"8","author":"Ruan","year":"2020","journal-title":"IEEE Access"},{"key":"ref_16","first-page":"822","article-title":"A new measure method of network node importance based on local characteristics","volume":"50","author":"Wang","year":"2010","journal-title":"J. Dalian Univ. Technol."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Chen, D., Gao, H., L\u00fc, L., and Zhou, T. (2013). Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering. PLoS ONE, 8.","DOI":"10.1371\/journal.pone.0077455"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1016\/j.physa.2011.09.017","article-title":"Identifying influential nodes in complex networks","volume":"391","author":"Chen","year":"2012","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"5490","DOI":"10.1016\/j.physa.2013.06.059","article-title":"A modified evidential methodology of identifying influential nodes in weighted networks","volume":"392","author":"Gao","year":"2013","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"128901","DOI":"10.7498\/aps.62.128901","article-title":"Node importance measurement based on the degree and clustering coefficient information","volume":"62","author":"Feng","year":"2013","journal-title":"Acta Phys. Sin."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"073407","DOI":"10.1088\/1742-5468\/aace08","article-title":"M-centrality: Identifying key nodes based on global position and local degree variation","volume":"2018","author":"Ibnoulouafi","year":"2018","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman","year":"1978","journal-title":"Soc. Netw."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1038\/nphys1746","article-title":"Identification of influential spreaders in complex networks","volume":"6","author":"Kitsak","year":"2010","journal-title":"Nat. Phys."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Tang, P., Song, C., Ding, W., Ma, J., Dong, J., and Huang, L. (2020). Research on the node importance of a weighted network based on the k-order propagation number algorithm. Entropy, 22.","DOI":"10.3390\/e22030364"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1002\/dac.1307","article-title":"A cascading failure model for interdomain routing system","volume":"25","author":"Guo","year":"2012","journal-title":"Int. J. Commun. Syst."},{"key":"ref_26","first-page":"28947","article-title":"Technique of Evaluating AS Importance Based on Preferred Route","volume":"23","author":"Hong","year":"2012","journal-title":"J. Softw."},{"key":"ref_27","first-page":"9","article-title":"Spreading dynamics based key nodes identification in inter-domain routing system","volume":"5","author":"Huihu","year":"2018","journal-title":"Chin. J. Netw. Inf. Secur."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/90.974527","article-title":"On inferring autonomous system relationships in the Internet","volume":"9","author":"Gao","year":"2001","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Zhao, W., Wang, Y., Xiong, X., and Li, Y. (2021). CFM-RFM: A Cascading Failure Model for Inter-Domain Routing Systems with the Recovery Feedback Mechanism. Information, 12.","DOI":"10.3390\/info12060247"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"012023","DOI":"10.1088\/1742-6596\/1693\/1\/012023","article-title":"Optimal valid path prediction method for inter-domain networks considering commercial relationships","volume":"1693","author":"Zhang","year":"2020","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_32","unstructured":"CAIDA (2021, September 25). The CAIDA AS Relationships Dataset. [EB\/OL]. Available online: http:\/\/www.caida.org\/data\/active\/as-relationships."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/11\/1456\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:24:54Z","timestamp":1760167494000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/11\/1456"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,2]]},"references-count":32,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2021,11]]}},"alternative-id":["e23111456"],"URL":"https:\/\/doi.org\/10.3390\/e23111456","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,2]]}}}