收拾残局：可重构网络中的自我修复
Picking up the Pieces: Self-Healing in Reconfigurable Networks
摘要：
我们认为，在这个意义上说，他们可以改变自己的拓扑结构在攻击过程中的可重构网络中的自我修复的问题。我们的目标是保持这些网络的连通性，即使在存在重复的敌对节点删除的情况下，也要在每次攻击后仔细添加边。我们提出了一种新的算法DASH，它可以证明确保：1）即使对手删除了网络中的所有节点，网络也保持连接; 2）没有节点的度增加超过2 log n，其中n是网络中初始节点的数量。DASH是完全分布式的;仅在已删除节点的邻居之间添加新的边;并且具有最多为n的对数的平均延迟和带宽成本。DASH具有这些属性，而与初始网络的拓扑无关，因此与传统的基于拓扑的防御攻击方法是正交和互补的。我们还证明了下界，表明DASH在最大限度地减少多次攻击的最大程度增加方面是渐近最优的。最后，我们给出了幂律图的实证结果，表明DASH在实践中表现良好，并且在减少最大度增加方面显着优于朴素算法。我们还提出了我们的算法和一个新的启发式的拉伸（增加最短路径长度）的性能的实证结果。
英文摘要：
We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity in these networks, even in the presence of repeated adversarial node deletion, by carefully adding edges after each attack. We present a new algorithm, DASH, that provably ensures that: 1) the network stays connected even if an adversary deletes up to all nodes in the network; and 2) no node ever increases its degree by more than 2 log n, where n is the number of nodes initially in the network. DASH is fully distributed; adds new edges only among neighbors of deleted nodes; and has average latency and bandwidth costs that are at most logarithmic in n. DASH has these properties irrespective of the topology of the initial network, and is thus orthogonal and complementary to traditional topology-based approaches to defending against attack. We also prove lower-bounds showing that DASH is asymptotically optimal in terms of minimizing maximum degree increase over multiple attacks. Finally, we present empirical results on power-law graphs that show that DASH performs well in practice, and that it significantly outperforms naive algorithms in reducing maximum degree increase. We also present empirical results on performance of our algorithms and a new heuristic with regard to stretch (increase in shortest path lengths).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
