摘要
本文提出了一种新的服务网格节点信誉评价算法.通过构建由实体间的直接信任构成的有向加权图,并通过修改经典的Dijkstra算法来计算实体间的推荐信任,结合直接信任刻画实体间的信誉评价,同时,该算法参考虚拟组织发起者对虚拟组织愿景特征的理解,将组织间信任关系以及虚拟组织所需服务或资源的种类作为信誉评价的重要依据,细粒度刻画候选者实体的信誉,从而适合具有自治域的服务网格环境中虚拟组织的构建.仿真实验表明,该算法能够较为真实地反映网格实体间的信任关系,有效遏制不良节点对服务网格系统的危害,对虚假交易攻击以及诽谤攻击均具有较强的抵御能力.
A novel reputation evaluation algorithm for service grid nodes is proposed,which computes the transitive trust between entities by performing a modified Dijkstra algorithm on a directional weighted overlay graph consists of grid entities and their direct trust values,and predicts the evaluation of reputation between entities by taking account of the inter-organization trust relationship,direct and transitive trust together.Besides,the proposed algorithm considers the VO（virtual organization） perspective idea of VO initiator and takes services or resources the target VO required as one of the most important fine-granularity evaluation criterion,which makes the algorithm more suitable for constructing VO in a category of service grid environment which includes autonomic organizations.Simulation experiment results show that our algorithm restrains the bad performers and resists against fake transaction attack and slander attack efficiently.It provides a clear advantage in the design of a VO infrastructure.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2010年第7期1557-1562,共6页
Acta Electronica Sinica
基金
国家自然科学基金(No.60903153)
国家自然科学基金重点项目(No.90715037)
国家973重点基础研究发展规划(No.2007CB714205)
高等学校博士学科点基金(No.200801410028)
重庆自然科学基金(No.2007BA2024)
关键词
信誉
虚拟组织构建
网格
协同攻击
reputation
virtual organization formation
service grid
coordinated attacks
