• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Mathematical Problems in Engineering >Combined Heuristic Attack Strategy on Complex Networks
【24h】

Combined Heuristic Attack Strategy on Complex Networks

机译：复杂网络的组合启发式攻击策略

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Usually, the existence of a complex network is considered an advantage feature and efforts aremade to increase its robustness against an attack. However, there exist also harmful and/or malicious networks, from social ones like spreading hoax, corruption, phishing, extremist ideology, and terrorist support up to computer networks spreading computer viruses or DDoS attack software or even biological networks of carriers or transport centers spreading disease among the population. New attack strategy can be therefore used against malicious networks, as well as in a worst-case scenario test for robustness of a useful network. A common measure of robustness of networks is their disintegration level after removal of a fraction of nodes. This robustness can be calculated as a ratio of the number of nodes of the greatest remaining network component against the number of nodes in the original network. Our paper presents a combination of heuristics optimized for an attack on a complex network to achieve its greatest disintegration. Nodes are deleted sequentially based on a heuristic criterion. Efficiency of classical attack approaches is compared to the proposed approach on Barabasi-Albert, scale-free with tunable power-law exponent, and Erdos-Renyi models of complex networks and on real-world networks. Our attack strategy results in a faster disintegration, which is counterbalanced by its slightly increased computational demands.
机译：通常，复杂网络的存在被认为是一项优势功能，并努力提高其抵御攻击的能力。但是，也存在有害和/或恶意网络，从传播骗局，腐败，网络钓鱼，极端主义意识形态和恐怖分子支持的社会网络，到传播计算机病毒或DDoS攻击软件的计算机网络，甚至是传播运营商或运输中心的生物网络，人口中的疾病。因此，可以对恶意网络使用新的攻击策略，以及在最坏情况下测试有用网络的健壮性。网络健壮性的常用衡量标准是除去一部分节点后的崩解程度。可以将这种鲁棒性计算为最大剩余网络组件的节点数与原始网络中节点数之比。我们的论文提出了一种针对复杂网络的攻击而优化的启发式方法，以实现最大程度的瓦解。根据启发式标准顺序删除节点。将经典攻击方法的效率与Barabasi-Albert上提出的方法，具有可调整的幂律指数的无标度方法以及复杂网络和实际网络上的Erdos-Renyi模型进行了比较。我们的攻击策略可导致更快的分解速度，但由于其计算需求略有增加而被抵消。

著录项

  • 来源
    《Mathematical Problems in Engineering》 |2017年第9期|6108563.1-6108563.9|共9页
  • 作者

    Simon Marek; Luptakova Iveta Dirgova; Huraj Ladislav; Hostovecky Marian; Pospichal Jiri;

  • 作者单位

    Univ Ss Cyril & Methodius, Dept Appl Informat & Math, J Herdu 2, Trnava 91701, Slovakia;

    Univ Ss Cyril & Methodius, Dept Appl Informat & Math, J Herdu 2, Trnava 91701, Slovakia;

    Univ Ss Cyril & Methodius, Dept Appl Informat & Math, J Herdu 2, Trnava 91701, Slovakia;

    Univ Ss Cyril & Methodius, Dept Appl Informat & Math, J Herdu 2, Trnava 91701, Slovakia;

    Univ Ss Cyril & Methodius, Dept Appl Informat & Math, J Herdu 2, Trnava 91701, Slovakia;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号