【24h】

On capacity planning for minimum vulnerability

机译:关于最小漏洞的容量规划

获取原文

摘要

This paper reports on a new approach to analyze network vulnerability, which is motivated by the robustness properties of the network. We introduce new vulnerability metrics, which are inherently robust to the topological changes and targeted attacks. The proposed vulnerability metrics are based on the evaluation of the variations in the value of network criticality, a global graph metric to quantify the robustness of a network, in the presence of topological failures. The proposed metrics are convex functions of link weights (capacities); therefore, we can construct convex optimization problems to design optimal weight sets in order to minimize the effect of failures. We apply these optimization problems on some well-known networks, in particular Abilene and Rocketfuel topologies, and through extensive simulations, we will show that by re-planning the network capacity using the provided optimization schemes, we can significantly decrease the vulnerability of a network to the failures and targeted attacks.
机译:本文报告了一种分析网络漏洞的新方法,该方法受网络的鲁棒性影响。我们引入了新的漏洞度量标准,这些度量标准固有地对拓扑更改和针对性攻击具有鲁棒性。提议的漏洞度量基于对网络关键性值的变化的评估,这是一种在存在拓扑故障的情况下用于量化网络健壮性的全局图形度量。提出的度量标准是链接权重(容量)的凸函数;因此,我们可以构造凸优化问题来设计最佳权重集,以最大程度地减少故障的影响。我们将这些优化问题应用于一些著名的网络,尤其是Abilene和Rocketfuel拓扑,并且通过广泛的仿真,我们将显示出,通过使用提供的优化方案重新规划网络容量,我们可以显着降低网络的脆弱性失败和有针对性的攻击。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号