检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海立信会计学院数学与信息学院,上海201620
出 处:《计算机科学》2011年第3期131-135,共5页Computer Science
基 金:上海市教育委员会科研创新项目(10YZ193);上海高校选拔培养优秀青年教师科研专项基金(slx08017)资助
摘 要:声誉是一种新型的信任建立机制,在P2P网络中,利用基于声誉的信任机制可以孤立劣质节点,选择更为可信的节点进行交互,以规避和减少风险。针对目前研究中存在的与网络结构耦合过紧、防止联合欺诈和声誉时效性处理不佳等问题,提出了一种新的基于声誉的信任模型RepTrust。模型采用与获取路径甚至评价者rater无关的声誉信息计算信任度,利用基于大多数原则的算法过滤不实声誉,利用衰减因子处理声誉的动态性。仿真实验表明模型在信任度计算、对付欺诈和动态声誉处理等方面效果明显。Reputation is a new method to build trust.In Peer-to-Peer networks,trust mechanism based on reputation can isolate inferior peers and recommend excellent peers in order to evade potential risk and provide better service.Some shortcomings were found in related research such as overly dependency on network structure,neglect of collusion cheat and disregard of dynamic reputation change.Aiming at these shortcomings,RepTrust,a novel trust model based on reputation was presented.In this model,reputation unrelated with raters and routes through that it been gotten was used to compute trust.Mendacious reputation was filtrated and an attenuation factor was introduced into to amend the dynamic reputation.According to the simulation experiment,this model is effective in trust computing,dealing with collusion cheat and dynamic reputation.
分 类 号:TP393.08[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43