• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

IKN-CF:一种基于级联故障识别域间路由系统中关键节点的方法。

IKN-CF: An Approach to Identify Key Nodes in Inter-Domain Routing Systems Based on Cascading Failures.

作者信息

Zhao Wendian, Wang Yongjie, Xiong Xinli, Zhao Jiazhen

机构信息

College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China.

Anhui Province Key Laboratory of Cyberspace Security Situation Awareness and Evaluation, Hefei 230037, China.

出版信息

Entropy (Basel). 2021 Nov 2;23(11):1456. doi: 10.3390/e23111456.

DOI:10.3390/e23111456
PMID:34828154
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC8622090/
Abstract

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.

摘要

域间路由系统是互联网中一个重要的复杂网络。对域间路由网络节点脆弱性的研究对互联网的稳定运行有很大的支持作用。针对节点脆弱性问题,我们提出了一种基于级联故障的域间路由系统关键节点识别方法(IKN-CF)。首先,我们分析了域间路由网络的拓扑结构,并提出了一种考虑业务关系的最优有效路径发现算法。然后,分析了域间路由网络中级联故障的原因和传播机制,我们提出了两个级联指标,它们可以近似节点故障对网络的影响。之后,我们建立了基于改进熵权TOPSIS(EWT)的关键节点识别模型,通过EWT计算可以得到网络中的关键节点序列。我们在两个真实的域间路由网络中比较了现有的三种方法。结果表明,IKN-CF的排序结果具有高精度、强稳定性和广泛的适用性。排序结果前100个节点的准确率可达83.6%,比现有三种方法的平均准确率至少高12.8%。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8eb5/8622090/5b883284aa80/entropy-23-01456-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8eb5/8622090/5287000f07ce/entropy-23-01456-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8eb5/8622090/96663926cd88/entropy-23-01456-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8eb5/8622090/0520a5269cee/entropy-23-01456-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8eb5/8622090/df3b813d1052/entropy-23-01456-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8eb5/8622090/e5345ae68bdd/entropy-23-01456-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8eb5/8622090/2adc4d12210b/entropy-23-01456-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8eb5/8622090/5b883284aa80/entropy-23-01456-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8eb5/8622090/5287000f07ce/entropy-23-01456-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8eb5/8622090/96663926cd88/entropy-23-01456-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8eb5/8622090/0520a5269cee/entropy-23-01456-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8eb5/8622090/df3b813d1052/entropy-23-01456-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8eb5/8622090/e5345ae68bdd/entropy-23-01456-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8eb5/8622090/2adc4d12210b/entropy-23-01456-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8eb5/8622090/5b883284aa80/entropy-23-01456-g007.jpg

相似文献

1
IKN-CF: An Approach to Identify Key Nodes in Inter-Domain Routing Systems Based on Cascading Failures.IKN-CF:一种基于级联故障识别域间路由系统中关键节点的方法。
Entropy (Basel). 2021 Nov 2;23(11):1456. doi: 10.3390/e23111456.
2
An approach to generate damage strategies for inter-domain routing systems based on multi-objective optimization.基于多目标优化的域间路由系统的破坏策略生成方法。
Math Biosci Eng. 2023 Apr 25;20(6):11176-11195. doi: 10.3934/mbe.2023495.
3
An algorithm for discovering vital nodes in regional networks based on stable path analysis.一种基于稳定路径分析的区域网络关键节点发现算法。
Sci Rep. 2023 Sep 16;13(1):15395. doi: 10.1038/s41598-023-39174-7.
4
Cascading Robustness Analysis of Wireless Sensor Networks with Varying Multisink Placement.具有可变多汇聚点放置的无线传感器网络的级联鲁棒性分析。
Sensors (Basel). 2023 Jun 5;23(11):5337. doi: 10.3390/s23115337.
5
Inter-domain routing based on simulated annealing algorithm in optical mesh networks.光网状网络中基于模拟退火算法的域间路由
Opt Express. 2004 Jul 12;12(14):3095-107. doi: 10.1364/opex.12.003095.
6
Limits of Predictability of Cascading Overload Failures in Spatially-Embedded Networks with Distributed Flows.具有分布式流的空间嵌入式网络中级联过载故障的可预测性限制
Sci Rep. 2017 Sep 15;7(1):11729. doi: 10.1038/s41598-017-11765-1.
7
An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization.一种无线传感器网络中的高效混合路由算法:结合跳数最小化的蚁群优化算法。
Sensors (Basel). 2018 Mar 29;18(4):1020. doi: 10.3390/s18041020.
8
Multi-hop routing mechanism for reliable sensor computing.多跳路由机制用于可靠的传感器计算。
Sensors (Basel). 2009;9(12):10117-35. doi: 10.3390/s91210117. Epub 2009 Dec 11.
9
W-GPCR Routing Method for Vehicular Ad Hoc Networks.车载自组织网络的W-GPCR路由方法
Sensors (Basel). 2020 Jun 16;20(12):3406. doi: 10.3390/s20123406.
10
Speedy routing recovery protocol for large failure tolerance in wireless sensor networks.无线传感器网络中具有大容错能力的快速路由恢复协议。
Sensors (Basel). 2010;10(4):3389-410. doi: 10.3390/s100403389. Epub 2010 Apr 7.

本文引用的文献

1
Research on the Node Importance of a Weighted Network Based on the -Order Propagation Number Algorithm.基于-阶传播数算法的加权网络节点重要性研究。 你提供的原文中“-Order”这里应该有具体的阶数信息缺失,翻译可能会稍显生硬,建议补充完整准确的内容以便更精准翻译。
Entropy (Basel). 2020 Mar 22;22(3):364. doi: 10.3390/e22030364.
2
Identifying influential nodes in large-scale directed networks: the role of clustering.识别大规模有向网络中的影响节点:聚类的作用。
PLoS One. 2013 Oct 31;8(10):e77455. doi: 10.1371/journal.pone.0077455. eCollection 2013.
3
Collective dynamics of 'small-world' networks.
“小世界”网络的集体动力学
Nature. 1998 Jun 4;393(6684):440-2. doi: 10.1038/30918.