摘要
为了对网络中自私行为作出有效监督,形成有效的信任关系,同时解决传统client-server环境中的单点失效与瓶颈效应问题.通过对社会关系网络中人际关系的观察以及采用IT治理思想,对其中的直接信任度算法和推荐信任度算法进行改进,形成了一种新型的P2P信任算法P-Trust.实验结果表明,在网络访问成功率和在服务热点问题上,新型的P-Trust算法可以有效提高网络访问命中率和成功率,以及实现网络的负载均衡.因此,将直接信任和推荐信任两方面综合得到的新型P-Trust信任算法可以有效的解决P2P网络中的信任问题和服务器瓶颈问题.
In order to efficiently monitor the selfish behavior in networks,form reliable relations and solve problems such as the single point of failure or bottleneck effect in traditional client-server environments,we adopt a novel P2P trust arithmetic named P-Trust based on the social people trust relation mechanism and the idea of IT governance,in which the direct trust arithmetic and the recommend trust arithmetic are modified.The P-Trust integrates the direct trust value and the recommended trust value to create the final trust value.Simulations prove that the P-Trust arithmetic can tackle the P2P trust problem in a simple and efficient way.
出处
《哈尔滨工业大学学报》
EI
CAS
CSCD
北大核心
2010年第7期1172-1176,共5页
Journal of Harbin Institute of Technology
基金
教育部人文社科基金资助项目(09YJC790053)
广东外语外贸大学‘211工程’资助项目(GDUFS2009-10-15)
关键词
IT治理
对等网络
信任控制
推荐值
节点
IT governance
P2P networks
trust control
recommended value
nodes