摘要
面向对等计算的信任度评估提出了一种新的信任管理量化算法,该算法解决了已有算法不能很好解决的信任时间衰减特性和节点联盟等问题,系统地对目前有代表性的网络信任评估算法进行了总结和分析,并对当前相关的国内外研究热点作了分类,同时给出了信任相关的一些定义以及算法应该考虑的问题,并提出一套完整解决问题的算法.定义了信任时间矫正函数、域信任矫正函数、信任值校准函数和准确度函数,并构造了信任时间矫正算法与域矫正算法,通过推导说明本算法具有良好的时间衰减性、历史经验相关性、新入节点奖励特性和联盟特性,同时给出了一般性的信任自然衰减曲线和8种典型特征域的系数变化范围.通过实验评价了算法的正确性和有效性,并和Azzedin算法进行比较,表明提出的算法效率和准确性有了显著的提高.
A novel quantitative network trust evaluation algorithm for peer-to-peer computing security system is proposed. The main features of the proposed model include time decay function and entity union function. First of all, the current representative algorithms of network trust evaluation are summerized and classified systematically. And the significant research fields of the related algorithms are categarized and the definition of trust related terminology is given. In this paper, an algorithm with trust time correct function, domain trust correct function and the definition of accuracy is constructed. Four features of the algorithm, time decay feature, history experience related feature, new entity award feature and union feature, are proved. At the same time, a natural trust decay curve is described and eight typical domain features are given. The experiments are also designed to evaluate the correctness and performances of the proposed algorithm, the results of the experiments are compared with Azzedin algorithm , and the results prove the sound performance and correctness of the algorithm. Finally, some related future research fields of the paper are pointed out.
出处
《计算机研究与发展》
EI
CSCD
北大核心
2007年第1期1-10,共10页
Journal of Computer Research and Development
基金
国家自然科学基金项目(60573042)
北京市自然科学基金项目(4052016)
关键词
对等计算
网络安全
信任评估
信任管理
量化算法
P2P computing
network security
trust evaluation
trust management
evaluation algorithm
