一种采用组内分级策略的P2P搜索模型

针对当前主流P2P网络模型搜索效率低，大量的消息通信造成网络负荷过重，以及网络扩展性不高问题，分析了现有P2P模型，同时考虑网络通信时延，提出了基于节点之间通信时延的P2P搜索模型．该模型通过对网络中的节点进行逻辑上的分组，然后分别建立组内和组间的搜索策略，以减少消息通信量及网络负荷，提高整个网络系统的性能．

Search model of P2P bases on tactics of ranking in group

At present, the way of application for search for the resource on the P2P network, such as overabundance message, heavy loads on the Telecom backbone and low efficiency, etc. is not perfect. In this paper, based on the current P2P model and delay of communication, a new P2P model is presented which logically groups the network and grades the node in the group. Then we build the in-group and between-group search mechanisms. The new P2P model obviously improves search efficiency and reduces the message of searching, and it also enhances the expansion ability in-group search mechanism of the whole network system.