面向拓扑一致性的层次化常数度P2P构建

王小海1，彭宇行1，李东升1，张红雷2

doi:10.3969/j.issn.1007130X.2011.

计算机工程与科学 >

2011 , Vol. 33 >Issue 6: 16 - 20

DOI: https://doi.org/10.3969/j.issn.1007130X.2011.

论文

面向拓扑一致性的层次化常数度P2P构建

展开

(1.并行与分布处理国防科技重点实验室，湖南长沙 410073；2.61741部队,北京 100094)

王小海(1983),男,山东安丘人，博士生，研究方向为结构化P2P计算。彭宇行(1963),男,湖南长沙人，博士,教授,研究方向为并行与分布式处理。李东升(1978),男,安徽桐城人，博士,副教授,研究方向为计算机网络和P2P资源定位技术。

收稿日期: 2010-05-10

修回日期: 2010-08-23

网络出版日期: 2011-06-25

基金资助

国家973计划资助项目（2005CB321801）;国家863计划资助项目（2009AA01Z142）

收起

A Construction Technology of TopologicallyAware Hierarchical Constant Degree P2P

Expand

(1.National Laboratory for Parallel and Distributed Processing,Changsha 410073;
2.Corps 61741,Beijing 100094,China)

Received date: 2010-05-10

Revised date: 2010-08-23

Online published: 2011-06-25

Fold

摘要

常数度P2P模型成为近几年的研究热点，但对于拓扑一致性问题，将已有的方法简单地移植到常数度P2P均存在严重的不足。本文针对常数度P2P FissionE提出一种层次化解决方案COFissionE：系统节点首先聚类成簇并组成低层overlay，然后由“下界重合”规则确定高层的簇间链接以保证高效的簇间通信。该规则同时限定了簇间邻居的最大值，因此选取常数度拓扑作为簇间overlay便能够保证各节点度数仍为常数量级；给出了COFissionE的路由、资源发布、查询及拓扑维护策略。实验表明该方法通过有限的开销有效地满足了拓扑一致性，降低了查询开销，是一种十分有效的FissionE改进方法，该方法的思想同时可以结合其他拓扑优化技术以及应用到其他常数度P2P。

关键词： 拓扑一致性; 常数度P2P; 层次化overlay

本文引用格式

王小海1，彭宇行1，李东升1，张红雷2 . 面向拓扑一致性的层次化常数度P2P构建[J]. 计算机工程与科学, 2011 , 33(6) : 16 -20 . DOI: 10.3969/j.issn.1007130X.2011.

Abstract

The constant degree P2P system has become the P2P domain’s promising hotspot, however, its topologicallyaware problem cannot be resolved by replanting the existing technologies simply. A framework named COFissionE for building topologicallyaware constant degree P2P systems is proposed: the peers are firstly clustered to form the lower level overlay, and at the higher level, a “coincide lower bound” rule is used to construct intercluster links which guarantee efficient intercluster communications and limit the number of intercluster neighbors. The resource publication, query and message routing methods in COFissionE are also provided. The experimental results show that COFissioinE fullfils the topologicallyaware property with limited overhead and reduces the query cost efficiently. This improvement can be replanted to other constant degree P2P systems with other optimization technologies.

Key words： topologicallyaware；constant degree P2P；hierarchical overlay

参考文献

［1］Loguinov D, Kumar A, Rai V, et al. GraphTheoretic Analysis of Structured PeertoPeer Systems: Routing Distances and Fault Resilience［C］∥Proc of ACM SIGCOMM’03, 2003:395406.
［2］Li D, Lu X, Wu J. FissionE: A Scalable Constant Degree and Low Congestion dht Scheme Based on Kautz Graphs［C］∥Proc of IEEE INFOCOM’05, 2005:16771688.
［3］李东升.基于对等模式的资源定位技术研究［D］.长沙：国防科学技术大学，2005.
［4］Guo D, Wu J, Chen H, et al. Moore: An Extendable PeertoPeer Network Based on Incomplete Kautz Digraph with Constant Degree［C］∥Proc of IEEE INFOCOM’05,2007:821829.
［5］Xue Guangtao, Jiang Yi, You Jinyuan, et al. A TopologyAware Hierarchical Structured Overlay Network Based on Locality Sensitive Hashing Scheme［C］∥Proc of UPGRADECN’07, 2007:38.
［6］ZeinalipourYazti D, Kalogeraki V. Structuring Topologically Aware Overlay Networks Using Domain Names［J］. Computer Networks, 2006,50(16):30643082.
［7］Castro M, Druschel P, Hu Y C, et al. TopologyAware Routing in Structured PeertoPeer Overlay Networks［C］∥Proc of FuDiCo’03, 2003:103107.
［8］Dabek F, Kaashoek M F, Karger D, et al. WideArea Cooperative Storage with CFS［C］∥Proc of SOSP’01, 2001:202215.
［9］Ratnasamy S, Handley M, Karp R, et al. TopologicallyAware Overlay Construction and Server Selection［C］∥Proc of Electronic Proceedings for the 1st Int’l Workshop on PeertoPeer Systems, 2002:1190 1199.
［10］Datta A, Girdzijauskas S, Aberer K. On de Bruijn Routing in Distributed Hash Tables: There and Back Again［C］∥Proc of the Fourth Int’l Conf on PeertoPeer Computing, 2004:159166.

Options

文章导航

模态框（Modal）标题

摘要

本文引用格式

Abstract

参考文献