分布式P2P网络基于索引的资源发现研究

The research of resource searching base on keywords indexing in peer-to-peer DHT networks

基于DHT的P2P网络很大程度地增加了网络的可扩展性和健壮性,但是它也带来了新的问题,在结构化的p2pDHT网络中,在事先知道所要搜索资源的全部关键字的情况下,通过DHT很容易定位到对应资源,但是,实际应用中,用户有时在搜索资源的过程中只给出了部分关键字,这时即使网络中存在相关资源也不能被发现。本文研究的重点就是如何在县现有可用的DHT网络模型的基础之上对其进行扩展,提出一种分布式的树型索引结构,使其能有效支持部分关键字匹配查询。

While the decentralized nature of peer-to-peer file sharing systems enables robustness and scalability, it also poses great challenges for resource lookup in these systems. Peer-to-peer distributed hash table （DHT） systems make it simple to discover specific data when their complete identifiers--or keys are known in advance. In practice, however,users looking up resources stored in peer-to-peer systems often have only partial information for identifying these resources.although the resources do exists,it cannot be discovered. In this paper , we propose a new method for data indexing on top of the current Distributed Hash Table peer-to-peer networks,using a distributed tree indexes architecture that enable partial-keywords matching.