一种有效的簇集主干点P2P网络结构模型

文中提出一种有效的簇集主干点P2P网络结构模型，克服了非结构化P2P系统中存在的扩展性不好和搜索效率不高的问题。该模型根据拓扑优先级把对等点聚类成簇形层级结构，从CN中选出GN充当簇的中心和服务提供者，实现定位查询和信息交互。为了衡量由主干点组成的骨干网的路由，文中设计了一种适用于应用级广播协议的路由算法。实验利用Java平台和仿真工具模拟实时网络环境，比较层级结构结合主干点骨干协议的系统模型和Gnuteua系统的代价。实验结果证明这种层级结构的簇集P2P模型，加上骨干网协议支持，在系统性能和可扩展性上带来了明显地提升，并可在大范围非结构化的P2P环境中得到应用推广。

An Efficient Clustered Global-Peer-P2P Architecture Model

This paper proposes an Efficient Clustered Global-Peer architecture(ECGP) to solve the scalability and query lookup efficiency problems of existing unstructured P2P systems. With ECGP, peers are grouped into hierarchical clusters according to their topological proximity, and global-peers are selected from regular peers to act as cluster leaders and service providers, achieving the query locality and information interaction between client peers and global peers inside the clusters. To scale the routing on overlay network connecting nodes, this paper designs a routing algorithm adapting for the application level broadcasting protocol. Experiments are performed with simulation tools and with a real network environment implemented in Java. The costs in ECGP architecture model with the broadcasting algorithm and in the Gnutella's are compared. Experiment results demonstrat that the ECGP architecture and the overlay-broadcasting algorithm achieve higher performance and good scalability, and they can be used to construct powerful infrastructures for large scale, unstructured P2P environments.