论文标题

按平均网络流量测量网络鲁棒性

Measuring Network Robustness by Average Network Flow

论文作者

Si, Weisheng, Mburano, Balume, Zheng, Wei Xing, Qiu, Tie

论文摘要

诸如Internet骨干和电网等基础设施网络对我们的日常生活至关重要。随着网络攻击的流行,衡量其鲁棒性已成为一个重要的问题。迄今为止,已经提出了许多鲁棒性指标。鲁棒性指标是具有以下三个属性的理想:考虑全局网络拓扑,严格增加链接添加时增加,并且在稀疏网络上的节点数量方面具有二次复杂性。本文建议将平均网络流(ANF)作为稳健度度量,并证明它严格增加,并通过利用Gomory-Hu树来计算具有二次复杂性的算法来计算ANF。因此,随着ANF本质上考虑了全球网络拓扑,ANF被公开为满足这三个属性的新的鲁棒性指标。此外,本文将ANF与七个现有代表性指标进行了比较,表明每个指标都有其自身的特征,因此没有银色的子弹来衡量网络鲁棒性,建议将几个指标一起应用以获得全面的视图。最后,通过在网络拓扑保持相同数量的节点和链接的情况下进行实验,报告了一些有趣的鲁棒性指标行为。

Infrastructure networks such as the Internet backbone and power grids are essential for our everyday lives. With the prevalence of cyber-attacks on them, measuring their robustness has become an important issue. To date, many robustness metrics have been proposed. It is desirable for a robustness metric to possess the following three properties: considering global network topologies, strictly increasing upon link additions, and having a quadratic complexity in terms of the number of nodes on sparse networks. This paper proposes to use Average Network Flow (ANF) as a robustness metric, and proves that it increases strictly, and gives an algorithm to compute ANF with a quadratic complexity by leveraging Gomory-Hu trees. Thus, with ANF intrinsically considering global network topologies, ANF is unveiled to be a new robustness metric satisfying those three properties. Moreover, this paper compares ANF with seven existing representative metrics, showing that each metric has its own characteristics, so there is no silver bullet in measuring network robustness and it is recommended to apply several metrics together to gain a comprehensive view. Finally, by experimenting on the scenarios in which network topologies preserve the same numbers of nodes and links, some interesting behaviors of robustness metrics are reported.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源