混合式P2P的路由搜索算法  

Hybrid P2P Routing Algorithm

作　　者：曹煦晖[1] 

机构地区：[1]集美大学计算机工程学院,福建厦门361021

出　　处：《集美大学学报（自然科学版）》2009年第3期315-319,共5页Journal of Jimei University：Natural Science

基　　金：福建省自然科学基金项目(A0640009);福建省自然科学基金项目(2008J0197)

摘　　要：混合式P2P网络在一定程度上解决了负载不均衡的问题,但没有解决P2P的平等自由的动态特性与网络服务所需要的信任协作模型之间产生的矛盾.因此,在HyperCube模型的基础上,提出一种线路可信度度量机制,建立并优化了查询预路由表里设定的路由索引,减少了不必要的路由,提高了节点之间的可信任机制和路由搜索的效率.The existing hybrid P2P systems have resolved the problem of unbalanced load to a certain degree, but they do not resolve the contradiction between the dynamic nature of P2P equal freedom and the confidence collaboration model required by web services. The paper gives a mechanism of routing credibility assessment based on HyperCube Model, which reduces unnecessary routing by the establishment and optimization of routing index in the pre-set routing table. This enhances the efficiency of the trusted mechanism in nodes and P2P-based network.

关 键 词：超级结点 RIG算法 消息路由 

分 类 号：TP393.07[自动化与计算机技术—计算机应用技术]