首页 | 官方网站   微博 | 高级检索  
相似文献
 共查询到18条相似文献,搜索用时 171 毫秒
1.
为了有效解决P2P电子商务的安全问题,通过对现有信任模型的研究,提出了一种改进的信任模型TM-AT.将信任分为直接信任和推荐信任,提供了两种获得节点信任值的方法.在计算直接信任时,提出用三元组表示直接信任值,有效地解决了新节点的信任值问题.同时,引入了交易金额等级、交易时间、失败加速因子等5个因素.在计算推荐信任时,增加了可信度.模拟实验结果表明,该模型能够有效打击恶意节点,保护诚实节点,增强P2P电子商务系统的可用性,降低交易风险.  相似文献   

2.
针对现有的信任模型不能很好地处理P2P网络环境中恶意节点提供虚假服务的欺作行为,及不积极提供诚实推荐的问题,提出了一种激励相容的P2P信誉模型(简称ICRM)。该模型使用时间区间的概念来标示经验和推荐的时间特性,利用直接信任度、推荐信任度及推荐可信度等机制来精确描述节点的实际信任等级,并引入参与层次来度量节点提供推荐的积极程度,从而有效地识别与抑制不同类型的恶意节点,激励节点积极提供诚实推荐。仿真实验表明,ICRM能够有效地抑制恶意节点的欺作行为及不诚实反馈行为,并能有效解决节点推荐积极性不高的问题。  相似文献   

3.
P2P信任模型研究   总被引:6,自引:0,他引:6  
在Peer-to-Peer网络中,由于节点的异构性、自治性等特点,节点兴趣和评价标准的不同会造成对服务节点的不公平评价,影响P2P网络的服务质量.针对这一问题,提出一种基于节点兴趣差异的P2P信任模型,用于量化和评估推荐的可信程度,根据节点间的兴趣相似性来确定对推荐的采纳程度,访问节点更倾向于相信与自身兴趣相似的推荐节点的评价.给出了推荐信息的放置方法及信任值求解算法.分析及仿真实验表明,该模型可以有效地提高P2P网络的服务质量.  相似文献   

4.
提出基于聚类的P2P电子商务信誉评价算法。该算法根据节点行为的相似性将节点聚类成若干集合,将每个节点集合视为一个节点进行迭代信誉计算。诚实节点行为相似性较高,通常聚类为最大的节点集合,在迭代计算中占主导地位。实验结果表明,与基于社会网络和概率估计的信誉评价体系算法相比,该算法误差较小。  相似文献   

5.
对等网(P2P)具有开放性、匿名性等特点,节点之间的交互类型复杂多样并且具有较小的重复交互性,导致其节点之间的信任关系难以确定。提出一种基于选择节点的P2P网络信任模型,通过直接信任和推荐信任得到节点综合信任值。选择推荐节点时,使用推荐节点与交互节点信任值相似度作为标准,以其信任差值最小的推荐节点作为被选择节点;同时,针对共谋团体的团伙欺骗,提出连带惩罚机制以及对提供可靠消息节点的奖励机制。仿真实验结果表明,该模型不但具有抗恶意节点攻击的能力,同时还具有较高的自适应能力。  相似文献   

6.
移动P2P网络的开放性和松耦合特性使得节点恶意攻击行为普遍存在,而现有基于声誉的信任模型大都基于“信誉值高的节点评价推荐越可信”的假设,无法识别恶意节点动态策略性攻击行为。针对这一问题,将社会网络相关理论引入信任系统,提出一种基于社会距离的信任模型(SD2Trust)。该模型区分了服务可信度和推荐评价可信度,用多维结构同型性描述向量刻画节点网络地位和行为特征,根据社会距离确定推荐节点集和推荐信誉计算权重,综合信任考虑了诋毁风险。理论分析和实验结果表明,该模型能有效对抗恶意节点动态策略攻击行为。  相似文献   

7.
针对P2P匿名网络存在的稳定性与安全性的问题,结合匿名通道建立时选择性能与表现良好的节点的需求,提出构建一种基于P2P匿名环境的信誉度模型.模型在信誉计算时引入通信持续时间作为参数,给出了动态调整节点信誉以及利用信任度计算推荐信誉度的数学方法.实验结果表明,该模型能有效地区分节点间的服务和评价行为,利用该信誉度模型选择节点构建匿名通道保证了P2P匿名通道的稳定性.  相似文献   

8.
随着宽带技术、IPV6,3G等技术的发展,流媒体已成为Internet承载的重要业务.在现实网络中,节点动态行为导致的抖动对P2P大规模可信流媒体网络的健壮性、可用性、服务响应速度和生命周期等产生了重要的影响.抖动对网络的影响分析和设计合理且有效的抑制策略已成为P2P大规模可信流媒体研究的一个重要方向.在全面分析节点动态行为导致抖动对网络性能影响的基础上,对描述抖动的时间、频度和连接3个重要指标进行了量化分析和建模,给出了应对抖动的规则和策略.仿真实验表明,该模型具有很好的抗抖动能力,提高了P2P可信流媒体网络的性能和服务质量,使P2P可信流媒体网络系统实现相对稳定和服务持续.  相似文献   

9.
针对现有P2P网络信任模型对用户行为不能准确描述等问题,该文提出了一种基于推荐和用户行为的信任模型。该模型在基于信任模型的基础上,通过引入推荐相似度及用户异常行为比对,从而提高了评价推荐的可信程度。分析与仿真结果也表明,该模型在使用中具有良好的性能。  相似文献   

10.
提出了一种适用于P2P环境的乐观公平交换协议。针对P2P网络的特点,该协议采用分布式的临时节点集替代传统公平交换协议中的可信第三方,可以有效降低对第三方信任度和信道可靠性的依赖。在保证临时节点集中超过2/3节点为诚实节点的条件下,协议可以提供完全的公平性和安全性保障。  相似文献   

11.
In peer-to-peer (P2P) systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third parties or authorities to mediate the interactions. Trust management through reputation mechanism to facilitate such interactions is recognized as an important element of P2P systems. It is, however, faced by the problems of how to stimulate reputation information sharing and honest recommendation elicitation. This paper presents an incentive compatible reputation mechanism for P2P systems. It has two unique features: (1) a recommender’s trustworthiness and level of confidence about the recommendation is considered for a more accurate calculation of reputations and fair evaluation of recommendations. (2) Incentive for participation and honest recommendation is implemented through a fair differential service mechanism. It relies on peer’s level of participation and on the recommendation credibility. Theoretic analysis and simulation show that the reputation mechanism we propose can help peers effectively detect dishonest recommendations in a variety of scenarios where more complex malicious strategies are introduced. Moreover, it can also stimulate peers to send sufficiently honest recommendations. The latter is realized by ensuring that active and honest recommenders, compared to inactive or dishonest ones, can elicit the most honest (helpful) recommendations and thus suffer the least number of wrong trust decisions.  相似文献   

12.
现有的P2P信任模型通常面向节点行为计算其信誉值,不能处理高信誉节点非法上传的特殊情况。提出一种双重度量信任模型,引入聚类方法分派节点的推荐权重,通过迭代得到节点的全局信誉值,然后结合资源自身的信誉信息,给出节点选择下载源的方法。仿真分析表明,相比类似模型,该模型可以进一步缓解节点恶意行为带来的负面影响。  相似文献   

13.
P2P开放网络资源共享信誉系统的研究与实现   总被引:1,自引:0,他引:1       下载免费PDF全文
网络信誉系统是一个用于综合运算、记录并发布各个客户端以往行为表现的系统。在P2P开放网络资源共享系统中,网络信誉系统起到了两个重要的作用:向用户提供信息以决定对方是否可信,激励交易双方在交易中保持良好的表现以提高自身的信誉度。该文介绍了P2P开放网络与信誉管理系统的概念,分析了现有的信誉系统、模型及其算法。在此基础上设计了新的模型,该模型以信任链方式查询节点信誉度,提出把信誉度分层的方法,通过Java实现了该系统,展望了网络信誉系统的发展方向。  相似文献   

14.
P2P网络中的节点很可能从另外的节点那里收到质量很差的服务和信息,名誉评价是解决该问题的常见方法.基于评分反馈的P2P名誉计算机制存在下述缺点:无法区分恶意评价和诚实节点给出错误评价间的差别;需要对评分可信度进行二次评价,使名誉计算速度减慢;用数字来表示节点名誉的方式不够自然.实际上,名誉评价的用途是确定节点可信度的相...  相似文献   

15.
Recommender systems in e-learning domain play an important role in assisting the learners to find useful and relevant learning materials that meet their learning needs. Personalized intelligent agents and recommender systems have been widely accepted as solutions towards overcoming information retrieval challenges by learners arising from information overload. Use of ontology for knowledge representation in knowledge-based recommender systems for e-learning has become an interesting research area. In knowledge-based recommendation for e-learning resources, ontology is used to represent knowledge about the learner and learning resources. Although a number of review studies have been carried out in the area of recommender systems, there are still gaps and deficiencies in the comprehensive literature review and survey in the specific area of ontology-based recommendation for e-learning. In this paper, we present a review of literature on ontology-based recommenders for e-learning. First, we analyze and classify the journal papers that were published from 2005 to 2014 in the field of ontology-based recommendation for e-learning. Secondly, we categorize the different recommendation techniques used by ontology-based e-learning recommenders. Thirdly, we categorize the knowledge representation technique, ontology type and ontology representation language used by ontology-based recommender systems, as well as types of learning resources recommended by e-learning recommenders. Lastly, we discuss the future trends of this recommendation approach in the context of e-learning. This study shows that use of ontology for knowledge representation in e-learning recommender systems can improve the quality of recommendations. It was also evident that hybridization of knowledge-based recommendation with other recommendation techniques can enhance the effectiveness of e-learning recommenders.  相似文献   

16.
基于信任和推荐的P2P信誉模型   总被引:4,自引:3,他引:1       下载免费PDF全文
席菁  王源  陆建德 《计算机工程》2009,35(4):143-145
分析现有信誉模型,提出一种使用信任机制和推荐机制的P2P信誉模型,利用决策树思想优化该模型。给出一种在分布式P2P系统中存取全局信任值的方法,解决了单点失效问题。实验结果表明,该模型对信任值的估算准确度以及判别虚假节点的能力高于现有模型。  相似文献   

17.
Trust research has become a key issue in the last few years as a novel and valid solution to ensure the security and application in peer-to-peer (P2P) file-sharing networks. The accurate measure of trust and reputation is a hard problem, most of the existing trust mechanisms adopt the historical behavior feedback to compute trust and reputation. Thus exploring the appropriate transaction behavior becomes a fundamental challenge. In P2P system, each peer plays two roles: server and client with responsibility for providing resource service and trust recommending respectively. Considering the resource service behavior and trust recommending behavior of each peer, in this paper, we propose a new trust model adopting the technology to calculate eigenvectors of trust rating and recommending matrices. In our model, we define recommended reputation value to evaluate the resource service behavior, and recommending reputation value to evaluate the trust recommendation behavior. Our algorithm would make these two reputation values established an interrelated relation of reinforcing mutually. The normal peers provide authentic file uploading services, as well as give correct trust recommendation, so they can form a trusted and cooperative transaction community via the mutual reinforcement of recommended and recommending reputation values. In this way, the transaction behaviors of those malicious peers are isolated and confined effectively. Extensive experimental results also confirm the efficiency of our trust model against the threats of exaggeration, collusion, disguise, sybil and single-behavior.  相似文献   

18.
非结构化P2P中的一种信任机制   总被引:1,自引:0,他引:1  
为了消除非结构化对等网络中恶意节点的恶意行为对网络系统造成的危害,提出了一个基于社会规则的声望模型,给出了该声望模型的参数及其计算方法,在基于社会规则的声望模型的基础上,提出一个用于非结构化对等网络的信任管理方案;给出了评价信息的分布式存储方案以及信任管理中声望和满意率的计算方法,提出了一个声望搜索算法;给出一个基于信任的拓扑进化算法,该算法改善了网络拓扑结构,增加了网络性能的稳定性.实验仿真表明该信任机制能够有效抵制非结构化对等网络应用中恶意节点的恶意攻击.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号