首页> 外文会议>2010 IEEE 30th International Conference on Distributed Computing Systems >Existence Theorems and Approximation Algorithms for Generalized Network Security Games
【24h】

Existence Theorems and Approximation Algorithms for Generalized Network Security Games

机译:广义网络安全博弈的存在性定理和近似算法

获取原文

摘要

Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to install anti-virus software or not on an individual basis while the viruses or worms start from a node chosen uniformly at random and spread along paths consisting of insecure nodes. They showed the surprising result that a pure Nash Equilibrium always exists when all nodes have identical installation costs and identical infection costs. In this paper we present a substantial generalization of the model of [2] that allows for arbitrary security and infection costs, and arbitrary distributions for the starting point of the attack. More significantly, our model GNS(d) incorporates a network locality parameter d which represents a hop-limit on the spread of infection as accounted for in the strategic decisions, due to either the intrinsic nature of the infection or the extent of neighborhood information that is available to a node. We determine that the network locality parameter plays a key role in the existence of pure Nash equilibria (NE): local (d = 1) and global games (d = ȡE;) have pure NE, while for GNS(d) games with 1
机译:Aspnes等人[2]引入了一种创新的游戏,用于对网络中病毒和蠕虫(安全漏洞)的传播进行建模。在此模型中,节点选择是否单独安装反病毒软件,而病毒或蠕虫则从随机地均匀选择的节点开始,并沿着由不安全节点组成的路径传播。他们展示了令人惊讶的结果,即当所有节点具有相同的安装成本和相同的感染成本时,纯Nash平衡始终存在。在本文中,我们对[2]模型进行了概括,该模型允许任意的安全性和感染成本以及攻击起点的任意分布。更重要的是,我们的模型GNS(d)合并了网络局部性参数d,该参数代表了感染扩散的跃点限制,这是战略决策中考虑的因素,这归因于感染的固有性质或邻居信息的程度,可用于节点。我们确定网络局部性参数在纯Nash均衡(NE)的存在中起关键作用:本地(d = 1)和全局博弈(d =ȡE;)具有纯NE,而对于GNS(d)博弈具有1

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号