基于Cayley图的P2P覆盖网络模型  

P2P overlay network model based on Cayley graph

作　　者：刘浩[1] 张连明[2] 朱同林[3] 

机构地区：[1]湖南人文科技学院计算机科学技术系,湖南娄底417000 [2]华南理工大学计算机科学与工程学院,广州510640 [3]华南农业大学信息学院,广州510642

出　　处：《吉林大学学报（工学版）》2011年第5期1414-1420,共7页Journal of Jilin University:Engineering and Technology Edition

基　　金：中国博士后科学基金项目(20070420782);国家科技部科技型中小企业技术创新基金项目(08c26214411225)

摘　　要：针对现有的P2P覆盖网络模型大多数没有考虑P2P网络的聚类性和对称性问题,本文采用基于Cayley图的代数图论构造方法,给出了一种新颖的P2P覆盖网络模型。该模型结构简单、高度对称,能满足P2P网络的自组织和可扩展性。分析和实验结果表明,该模型在容错性、查询效率和负载均衡方面都要优于现有的覆盖网络模型Chord、CAN,并具有高聚类性。One of the hotspots in structuralized P2P network research is to construct a high-powered overlay network model for P2P system.However,the clustering and symmetry properties of P2P network were not taken into account in existing P2P overlay network models.In this work,a novel P2P overlay network model is proposed by adopting Cayley graph based algebraic graph theory method.The simplicity and symmetry of the proposed model can ensure the self-organization and scalability of P2P network.Analytical and experimental results show that this model provides better robustness,higher enquiry efficiency and better load balance than existing P2P overlay network models,such as Chord and CAN.Furthermore,this model possesses the property of high clustering.

关 键 词：计算机应用 P2P网络 CAYLEY图 覆盖网络 聚类性 容错性 对称性 负载均衡 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]