检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:于真[1] 周芳[1] 郑雪峰[1] 刘海燕[1] 梁春霞[2]
机构地区:[1]北京科技大学信息工程学院,北京100083 [2]北京城市学院人工智能研究所
出 处:《小型微型计算机系统》2010年第11期2185-2190,共6页Journal of Chinese Computer Systems
基 金:内蒙古自然科学基金项目(200711020819)资助
摘 要:在Peer-to-Peer网络中,Free-riding行为严重影响了P2P网络的可供使用的资源总量,降低了P2P网络的整体服务能力.针对这一问题,提出一种基于信任的激励机制TIM,适用于非结构化P2P网络.从多个方面统计了节点转发查询的能力,从而确定节点的查询被转发的范围;通过比较请求节点和服务节点的信誉来决定请求节点获取服务的概率;在选择响应节点时,优先选择信誉度高的服务节点.给出了信息的放置方法及查询转发、服务提供、响应处理三方面的算法.仿真实验和分析表明,激励机制TIM可以有效识别搭便车节点和恶意节点,并促进了节点之间的合作,提高了P2P网络的整体可用性.In Peer-to-Peer networks, free-riding behavior affects available resources of P2P networks seriously, and degrades the overall capability to provide service in P2P networks. A trust-based incentive mechanism for unstructured P2P networks called TIM is proposed. The ability of sending query messages is calculated from various aspects to determine the forward scope of queries. The comparison between reputations of the access peer and the service provider is used to calculate the probability of providing service for this ac- cess peer. The service provider with higher reputation would get more opportunities to be chosen by access peers. TIM designs special structures to store peers' information,and proposes algorithms for sending queries,providing services and dealing with responses. Experirnents show that TIM can effectively identify malicious peers and free-rider, and promote cooperation among peers, that enhances the overall usability of P2P networks.
关 键 词:Peer-to—Peer 非结构化 搭便车 信任 激励机制
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30