网络不相交脆弱性的最优冗余度
Optimal redundancy against disjoint vulnerabilities in networks
摘要:
Reddit通常用于保证网络系统中的持续功能。然而,许多节点往往容易受到相同的故障或对手。如果两条路径都依赖于共享可访问性的节点,则“备份”路径是不够的。例如,如果Internet的两个节点在不使用属于给定不可信实体的路由器的情况下无法连接,则它们的所有通信-无论使用的是哪条特定路径-都将被控制实体拦截。在这种情况下以及许多其他情况下,影响网络的漏洞是不相交的:每个节点恰好具有一个弱点,但是相同的弱点可以影响许多节点。在这种情况下,为了发现最佳的冗余,我们将每个漏洞描述为一种颜色,并开发了一个“避色渗透”,它揭示了一个隐藏的避色连接。我们提出了一般网络的颜色避免渗透算法和随机图的分析理论,均匀分布的颜色,包括临界现象。我们证明了我们的理论,揭示隐藏的颜色,避免互联网的连接。我们发现,与美国等高度互联的国家相比,互联程度较低的国家更有可能通过最佳冗余路径进行安全通信。我们的研究结果揭示了复杂系统中隐藏结构的一个新层,并可以通过优化冗余在生物,经济和通信网络等广泛的系统中提高安全性和鲁棒性。
英文摘要:
Redundancy is commonly used to guarantee continued functionality in networked systems. However, often many nodes are vulnerable to the same failure or adversary. A "backup" path is not sufficient if both paths depend on nodes which share a vulnerability.For example, if two nodes of the Internet cannot be connected without using routers belonging to a given untrusted entity, then all of their communication-regardless of the specific paths utilized-will be intercepted by the controlling entity.In this and many other cases, the vulnerabilities affecting the network are disjoint: each node has exactly one vulnerability but the same vulnerability can affect many nodes. To discover optimal redundancy in this scenario, we describe each vulnerability as a color and develop a "color-avoiding percolation" which uncovers a hidden color-avoiding connectivity. We present algorithms for color-avoiding percolation of general networks and an analytic theory for random graphs with uniformly distributed colors including critical phenomena. We demonstrate our theory by uncovering the hidden color-avoiding connectivity of the Internet. We find that less well-connected countries are more likely able to communicate securely through optimally redundant paths than highly connected countries like the US. Our results reveal a new layer of hidden structure in complex systems and can enhance security and robustness through optimal redundancy in a wide range of systems including biological, economic and communications networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。