复杂网络鲁棒性的刻画
Characterizing the Robustness of Complex Networks
摘要：
随着越来越雄心勃勃的计划，如GENI和FIND，寻求设计未来的互联网，它成为当务之急，以定义健壮的拓扑结构的特征，并建立未来的网络优化的鲁棒性。本文研究了网络拓扑结构的特点，保持高水平的吞吐量，尽管有多种攻击。为此，我们选择属于主要网络模型和一些现实世界的网络拓扑结构。我们考虑三种类型的攻击：删除随机节点，高度节点和高介数节点。我们使用弹性作为我们的鲁棒性措施，并通过我们的分析，说明不同的拓扑结构可以有不同程度的鲁棒性。特别是，弹性可以下降到0.8%的上限的基础上使用的攻击。这一结果证实了优化网络拓扑设计的必要性。此外，我们实现了一个权衡功能，结合弹性下的三种攻击策略，并考虑网络的成本。我们广泛的模拟表明，对于一个给定的网络密度，定期和半定期的拓扑结构可以有更高程度的鲁棒性比异构拓扑结构，链路冗余是一个充分的，但不是必要的鲁棒性条件。
英文摘要：
With increasingly ambitious initiatives such as GENI and FIND that seek to design the future Internet, it becomes imperative to define the characteristics of robust topologies, and build future networks optimized for robustness. This paper investigates the characteristics of network topologies that maintain a high level of throughput in spite of multiple attacks. To this end, we select network topologies belonging to the main network models and some real world networks. We consider three types of attacks: removal of random nodes, high degree nodes, and high betweenness nodes. We use elasticity as our robustness measure and, through our analysis, illustrate that different topologies can have different degrees of robustness. In particular, elasticity can fall as low as 0.8% of the upper bound based on the attack employed. This result substantiates the need for optimized network topology design. Furthermore, we implement a tradeoff function that combines elasticity under the three attack strategies and considers the cost of the network. Our extensive simulations show that, for a given network density, regular and semi-regular topologies can have higher degrees of robustness than heterogeneous topologies, and that link redundancy is a sufficient but not necessary condition for robustness.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
