P2P兴趣子网自主构建机制及其路由算法研究

Research on autonomous constructing mechanism of interest subnets and its routing algorithm in P2P network

信息是分散在各个节点上存储的,为更准确、更快速地获取所需要的信息,在返回检索结果所经过的每个节点上建立兴趣及其相关节点对应关系,自主、动态地在覆盖网络的基础上构建兴趣子网,使得具有相似兴趣的用户节点在逻辑上位于邻近位置,并通过动态计算节点的贡献率来调整兴趣子网的拓扑结构,使得信息检索的覆盖面不局限在固定的节点范围内,从而即使在TTL较小的情况下也能够获得满意的检索结果.同时,利用关键词的关联性特点,提高信息检索的精度.实验结果表明,随着检索的重复进行,利用所提出的算法能够逐步建立起兴趣子网,从而能够提高信息检索的成功率.

Since the information is stored on the distributed peers, how to retrieve the information accurately and rapidly has been the important research subject, An approach to constructing the subnet of interest autonomously and dynamically is proposed by building the relations between interest and their corresponding peers on the nodes through which the retrieval results are returned. It logically makes the nodes with similar interest adjacent, and the topologies of the subnets of interest are adjusted dynamically by calculating the contribution rate of the related nodes in order to solve the problem that the coverage of retrieval is limited to the fixed nodes, and therefore the satisfied results can be retrieved even using smaller TTL. Meanwhile, the accuracy of retrieval can be improved by using the keywords relationship. The experimental results show that the interest subnets can be formed gradually by using the proposed approach and thus the higher success rate of retrieval can be achieved.