Computer Engineering & Science >
A Construction Technology of TopologicallyAware Hierarchical Constant Degree P2P
Received date: 2010-05-10
Revised date: 2010-08-23
Online published: 2011-06-25
The constant degree P2P system has become the P2P domain’s promising hotspot, however, its topologicallyaware problem cannot be resolved by replanting the existing technologies simply. A framework named COFissionE for building topologicallyaware 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 intercluster links which guarantee efficient intercluster communications and limit the number of intercluster neighbors. The resource publication, query and message routing methods in COFissionE are also provided. The experimental results show that COFissioinE fullfils the topologicallyaware 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.
WANG Xiaohai1，PENG Yuxing1，LI Dongsheng1，ZHANG Honglei2 . A Construction Technology of TopologicallyAware Hierarchical Constant Degree P2P[J]. Computer Engineering & Science, 2011 , 33(6) : 16 -20 . DOI: 10.3969/j.issn.1007130X.2011.
［1］Loguinov D, Kumar A, Rai V, et al. GraphTheoretic Analysis of Structured PeertoPeer Systems: Routing Distances and Fault Resilience［C］∥Proc of ACM SIGCOMM’03, 2003:395406.
［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:16771688.
［3］李东升.基于对等模式的资源定位技术研究［D］.长沙：国防科学技术大学，2005.
［4］Guo D, Wu J, Chen H, et al. Moore: An Extendable PeertoPeer Network Based on Incomplete Kautz Digraph with Constant Degree［C］∥Proc of IEEE INFOCOM’05,2007:821829.
［5］Xue Guangtao, Jiang Yi, You Jinyuan, et al. A TopologyAware Hierarchical Structured Overlay Network Based on Locality Sensitive Hashing Scheme［C］∥Proc of UPGRADECN’07, 2007:38.
［6］ZeinalipourYazti D, Kalogeraki V. Structuring Topologically Aware Overlay Networks Using Domain Names［J］. Computer Networks, 2006,50(16):30643082.
［7］Castro M, Druschel P, Hu Y C, et al. TopologyAware Routing in Structured PeertoPeer Overlay Networks［C］∥Proc of FuDiCo’03, 2003:103107.
［8］Dabek F, Kaashoek M F, Karger D, et al. WideArea Cooperative Storage with CFS［C］∥Proc of SOSP’01, 2001:202215.
［9］Ratnasamy S, Handley M, Karp R, et al. TopologicallyAware Overlay Construction and Server Selection［C］∥Proc of Electronic Proceedings for the 1st Int’l Workshop on PeertoPeer 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 PeertoPeer Computing, 2004:159166.
/
| 〈 |
|
〉 |