虚拟树覆盖中的物理扩展器
Physical expander in Virtual Tree Overlay
摘要:
在本文中,我们提出了一个新的建设constantdegree扩展动机他们的应用在P2P覆盖网络,特别是在鲁棒树覆盖的设计。我们的主要结果可以陈述如下。考虑一棵完全二叉树T,在叶节点和内部节点之间构造一个随机配对树。我们证明了通过收缩所有对(叶内部节点)从T得到的图G以高概率实现恒定的节点扩展。使用我们的结果在提高树覆盖的鲁棒性是直接的。也就是说,如果参与覆盖的每个物理节点管理耦合一个虚拟内部节点和一个虚拟叶节点的随机对,则物理节点层表现出具有高概率的恒定扩展。我们包括困难的随机树虚拟化,提出了一个本地的,自组织和流失弹性均匀随机配对算法O(log2 n)的运行时间。该算法的优点是不需要修改原有的树的虚拟覆盖(只控制物理节点和虚拟节点之间的映射)。因此,我们的计划是通用的,可以应用到大量的树覆盖实现。我们通过大量的模拟验证其在动态环境中的性能。
英文摘要:
In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust trees overlay. Our key result can be stated as follows. Consider a complete binary tree T and construct a random pairing Π between leaf nodes and internal nodes. We prove that the graph GΠobtained from T by contracting all pairs (leaf-internal nodes) achieves a constant node expansion with high probability. The use of our result in improving the robustness of tree overlays is straightforward. That is, if each physical node participating to the overlay manages a random pair that couples one virtual internal node and one virtual leaf node then the physical-node layer exhibits a constant expansion with high probability. We encompass the difficulty of obtaining this random tree virtualization by proposing a local, selforganizing and churn resilient uniformly-random pairing algorithm with O(log2 n) running time. Our algorithm has the merit to not modify the original tree virtual overlay (we just control the mapping between physical nodes and virtual nodes). Therefore, our scheme is general and can be applied to a large number of tree overlay implementations. We validate its performances in dynamic environments via extensive simulations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。