A Virtual Ring Method for Building Small-World Structured P2P Overlays
A Virtual Ring Method for Building Small-World Structured P2P Overlays
复制标题
DOI：
10.1109/tkde.2008.102
复制
发表时间：
2008-12
影响因子：
8.9
通讯作者：
H. Zhuge;Xiaoping Sun
中科院分区：
文献类型：
--
作者：
H. Zhuge;Xiaoping Sun
本文提出了一种通用的虚拟环方法，用于在具有距离度量的ID空间中嵌入基本拓扑的小世界结构化P2P网络的设计和分析。其基本思想是根据距离度量从基本拓扑中抽象出一个虚拟环，然后在虚拟环中构建小世界长链路，并将这些链路映射回真实网络，从而构造小世界路由表，从而实现对数贪婪路由效率。提出了可以用虚环方法转化成小世界的基本拓扑的四个性质。将虚拟环方法应用于具有曼哈顿距离的d环面基拓扑、高维d环面基拓扑以及具有树距离的非平衡d环面和环拓扑等基拓扑。理论分析和仿真实验证明了所提叠加的有效性和弹性。
This paper presents a general virtual ring method to design and analyze small-world structured P2P networks on the base topologies embedded in ID spaces with distance metric. Its basic idea is to abstract a virtual ring from the base topology according to the distance metric, then build small-world long links in the virtual ring and map the links back onto the real network to construct the small-world routing tables for achieving logarithmic greedy routing efficiency. Four properties are proposed to characterize the base topologies that can be turned into small-world by the virtual ring method. The virtual ring method is applied to the base topologies of d-torus with Manhattan distance, high dimensional d-torus base topologies, and other base topologies including the unbalanced d-torus and the ring topology with tree distance. Theoretical analysis and simulation experiments demonstrate the efficiency and the resilience of the proposed overlays.