arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1012.5961physics.soc-phcond-mat.othercs.SI
收藏

网络对关键链路故障的脆弱性

Vulnerability of Networks Against Critical Link Failures

Serdar Çolak, Hilmi Luş, Ali Rana Atılgan

摘要:

已知网络易于发生链路故障。在本文中,我们着手研究不同的连接模式的网络如何响应不同的链路故障计划的连接,聚类系数和最短路径长度。然后,我们提出了一个措施,我们称之为网络的脆弱性,用于评估这些故障可能造成的损害的程度。接受断开的节点对作为损坏指标,脆弱性简单地表示多快的关键链路的故障导致网络经历指定的损坏程度。在不同的破坏规范下分析脆弱性表明,无标度网络相对更容易受到小故障的影响,但更有效;而Erdös-Rényi网络是最不脆弱的,尽管缺乏任何集群结构。

英文摘要:

Networks are known to be prone to link failures. In this paper we set out to investigate how networks of varying connectivity patterns respond to different link failure schemes in terms of connectivity, clustering coefficient and shortest path lengths. We then propose a measure, which we call the vulnerability of a network, for evaluating the extent of the damage these failures can cause. Accepting the disconnections of node pairs as a damage indicator, vulnerability simply represents how quickly the failure of the critical links cause the network to undergo a specified damage extent. Analyzing the vulnerabilities under varying damage specifications shows that scale free networks are relatively more vulnerable for small failures, but more efficient; whereas Erdös-Rényi networks are the least vulnerable despite lacking any clustered structure.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑