宽恕树:一种自愈的分布式数据结构
The Forgiving Tree: A Self-Healing Distributed Data Structure
摘要:
我们认为在对等网络中的自我修复的问题,是反复攻击的一个无所不知的对手。我们假设以下过程持续多达n轮,其中n是网络中初始节点的总数:对手从网络中删除任意节点,然后网络通过快速添加少量新边来做出响应。我们提出了一个分布式的数据结构,确保两个关键属性。首先,网络的直径永远不会大于$O(\log Δ)$乘以其原始直径,其中$Δ$是网络初始的最大度。我们注意到,对于许多对等系统,$Δ$是多对数的,因此直径增加将是O(log log n)乘法因子。第二,任何节点的度在其原始度上的增加永远不会超过3。我们的数据结构是完全分布式的,每轮具有O(1)延迟,并且要求每个节点每轮发送和接收O(1)消息。的数据结构需要一个初始设置阶段,具有延迟等于直径的原始网络,并要求,具有很高的概率,每个节点v发送O(log n)消息沿每个边缘事件v。我们的方法是正交的,并补充传统的基于拓扑的方法来抵御攻击。
英文摘要:
We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up to n rounds where n is the total number of nodes initially in the network: the adversary deletes an arbitrary node from the network, then the network responds by quickly adding a small number of new edges. We present a distributed data structure that ensures two key properties. First, the diameter of the network is never more than $O(\log Δ)$ times its original diameter, where $Δ$ is the maximum degree of the network initially. We note that for many peer-to-peer systems, $Δ$ is polylogarithmic, so the diameter increase would be a O(log log n) multiplicative factor. Second, the degree of any node never increases by more than 3 over its original degree. Our data structure is fully distributed, has O(1) latency per round and requires each node to send and receive O(1) messages per round. The data structure requires an initial setup phase that has latency equal to the diameter of the original network, and requires, with high probability, each node v to send O(log n) messages along every edge incident to v. Our approach is orthogonal and complementary to traditional topology-based approaches to defending against attack.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。