基本信息来源于合作网站,原文需代理用户跳转至来源网站获取       
摘要:
Trust has become an increasingly important issue given society’s growing reliance on electronic transactions.Peer-to-peer(P2P)networks are among the main electronic transaction environments affected by trust issues due to the freedom and anonymity of peers(users)and the inherent openness of these networks.A malicious peer can easily join a P2P network and abuse its peers and resources,resulting in a large-scale failure that might shut down the entire network.Therefore,a plethora of researchers have proposed trust management systems to mitigate the impact of the problem.However,due to the problem’s scale and complexity,more research is necessary.The algorithm proposed here,HierarchTrust,attempts to create a more reliable environment in which the selection of a peer provider of a file or other resource is based on several trust values represented in hierarchical form.The values at the top of the hierarchical form are more trusted than those at the lower end of the hierarchy.Trust,in HierarchTrust,is generally calculated based on the standard deviation.Evaluation via simulation showed that HierarchTrust produced a better success rate than the well-established EigenTrust algorithm.
推荐文章
基于Peer-to-Peer模型的增强OAI框架
OAI协议
元数据互操作
P2P
蜂窝网中使用Peer-to-Peer的网络模型
peer-to-peer
单跳
混合网络
基于遗传算法的Peer-to-Peer路由算法R-GA
路由
Peer-to-Peer
遗传算法
适度函数
基于Peer-to-Peer的单点登录服务研究和实现
Peer-to-Peer
身份认证
单点登录
SSO
内容分析
关键词云
关键词热度
相关文献总数  
(/次)
(/年)
文献信息
篇名 A Hierarchical Trust Model for Peer-to-Peer Networks
来源期刊 计算机、材料和连续体(英文) 学科 工学
关键词 PEER-TO-PEER network TRUST management REPUTATION MALICIOUS PEERS
年,卷(期) 2019,(5) 所属期刊栏目
研究方向 页码范围 397-404
页数 8页 分类号 TP3
字数 语种
DOI
五维指标
传播情况
(/次)
(/年)
引文网络
引文网络
二级参考文献  (0)
共引文献  (0)
参考文献  (0)
节点文献
引证文献  (0)
同被引文献  (0)
二级引证文献  (0)
2019(0)
  • 参考文献(0)
  • 二级参考文献(0)
  • 引证文献(0)
  • 二级引证文献(0)
研究主题发展历程
节点文献
PEER-TO-PEER
network
TRUST
management
REPUTATION
MALICIOUS
PEERS
研究起点
研究来源
研究分支
研究去脉
引文网络交叉学科
相关学者/机构
期刊影响力
计算机、材料和连续体(英文)
月刊
1546-2218
江苏省南京市浦口区东大路2号东大科技园A
出版文献量(篇)
346
总下载数(次)
4
总被引数(次)
0
论文1v1指导