基于资源规模的P2P网络搜索机制的研究

针对目前非结构化对等网络搜索算法查询到的资源量少、查询效率不高而且系统开销巨大的缺陷,提出了基于资源规模的搜索机制.将分散在各个节点上的资源索引信息向局部区域内资源规模较大的节点进行聚集,按照索引规模描述参数的扩散方向建立起冗余的资源索引系统.执行搜索动作时,查询命令沿着资源规模最大的一条路径向前传递,并采用回溯和重新选择邻居节点的方法处理失败的查询命令,在有限的搜索生命期内尽量地向前投递查询请求.对比试验证明:该算法能够在较少的步骤内覆盖对等网络的大部分资源信息,同时系统的开销较低.算法具有较高的查询效率,有效地提高了系统的性能.

P2P network lookup mechanism based on resource size

The lookup mechanism based on resource size was brought forward to solve the problem that current unstructured P2P network lookup algorithms could only get few resources and had bad performance and huge overhead.The resource indexes diffused in the peers were congregated to the peer that had the largest resource size in the local domain.The redundant resource index system was then built according to the diffusion direction of index size describing parameters.The query command would be delivered along the path that had the largest resource size when the algorithm was executed.Back tracing and neighbor peer reselection were adopted to deal with the fail queries.The query command would be delivered to the best of its ability in the lookup TTL.The contrast simulating experiment proves that the algorithm can cover more P2P network resource in the several steps and increase little overhead.The presented mechanism has high lookup efficiency and improves the system performance.