宽恕图:一种在对抗攻击下低拉伸的分布式数据结构
The Forgiving Graph: A distributed data structure for low stretch under adversarial attack
摘要:
我们认为在对等网络中的自我修复的问题,是反复攻击的一个无所不知的对手。我们假设,在一系列回合中,对手要么插入一个具有任意连接的节点,要么从网络中删除一个任意节点。网络通过快速“修复”来响应每一个这样的变化,其中包括添加或删除少量的边。这些修复在对抗性删除后基本上保留了节点的接近性,而不会在以下意义上过多地增加节点度。在算法中的任何点处,在通过仅考虑对抗性插入(不考虑对抗性删除)而形成的图中距离为$\ell$的节点$v$和$w$在实际图中的距离将至多为$\ell \log n$,其中$n$是迄今为止看到的顶点的总数。类似地,在任何点处,节点$v$的度在仅具有对抗性插入的图中将是$d$,在实际图中将具有至多3d的度。我们的算法是完全分布式的,具有低延迟和带宽要求。
英文摘要:
We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick "repairs," which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes $v$ and $w$ whose distance would have been $\ell$ in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most $\ell \log n$ in the actual graph, where $n$ is the total number of vertices seen so far. Similarly, at any point, a node $v$ whose degree would have been $d$ in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our algorithm is completely distributed and has low latency and bandwidth requirements.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。